#include<map>
#include<set>
#include<queue>
#include<stack>
#include<cmath>
#include<cstdio>
#include<bitset>
#include<string>
#include<vector>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<functional>
using namespace std;
typedef long long LL;
const int low(int x) { return x&-x; }
const int INF = 0x7FFFFFFF;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 10;
int T, cas = 1;
int n, m;
int x[20], y[20], f[20];
int dp[17][1 << 17][17], c[17][1 << 17][17], ans;
struct point
{
int x, y, z;
point(int x = 0, int y = 0, int z = 0) :x(x), y(y), z(z) {};
};
int main()
{
scanf("%d", &T);
while (T--)
{
scanf("%d", &n);
for (int i = 0; i < n; i++) f[i] = -1;
for (int i = 0; i < n; i++)
{
scanf("%d%d", &x[i], &y[i]);
if (y[i] != -1) f[y[i]] = i;
}
queue<point> p;
if (f[0] == -1)
{
for (int i = 0; i < 16; i++)
{
if (y[i] == -1)
{
p.push(point(0, 1 << i, i));
dp[1][1 << i][i] = 0;
c[1][1 << i][i] = cas;
}
}
}
else
{
p.push(point(0, 1 << f[0], f[0]));
dp[1][1 << f[0]][f[0]] = 0;
c[1][1 << f[0]][f[0]] = cas;
}
ans = -INF;
while (!p.empty())
{
point q = p.front(); p.pop();
if (q.x == n) continue;
if (f[q.x + 1] == -1)
{
for (int i = 0; i < n; i++)
{
if ((1 << i) & q.y || y[i] != -1) continue;
if (c[q.x + 1][q.y ^ (1 << i)][i] != cas)
{
c[q.x + 1][q.y ^ (1 << i)][i] = cas;
dp[q.x + 1][q.y ^ (1 << i)][i] = dp[q.x][q.y][q.z] + x[q.z] * x[i];
p.push(point(q.x + 1, q.y ^ (1 << i), i));
}
else
{
dp[q.x + 1][q.y ^ (1 << i)][i] = max(dp[q.x + 1][q.y ^ (1 << i)][i], dp[q.x][q.y][q.z] + x[q.z] * x[i]);
}
}
}
else
{
int i = f[q.x + 1];
if (c[q.x + 1][q.y ^ (1 << i)][i] != cas)
{
c[q.x + 1][q.y ^ (1 << i)][i] = cas;
dp[q.x + 1][q.y ^ (1 << i)][i] = dp[q.x][q.y][q.z] + x[q.z] * x[i];
p.push(point(q.x + 1, q.y ^ (1 << i), i));
}
else
{
dp[q.x + 1][q.y ^ (1 << i)][i] = max(dp[q.x + 1][q.y ^ (1 << i)][i], dp[q.x][q.y][q.z] + x[q.z] * x[i]);
}
}
}
for (int i = 0; i < n; i++)
{
if (c[n-1][(1 << n) - 1][i] == cas)
{
ans = max(ans, dp[n - 1][(1 << n) - 1][i]);
}
}
printf("Case #%d:\n%d\n", cas++, ans);
}
return 0;
}