#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=2e6+5,mod=1e9+7;
int mat[20][20],dp[(1<<20)];
int main()
{
int t,cnt=1;cin>>t;
while(t--)
{
int n;cin>>n;
for(int i=1;i<=n;++i)
{
for(int j=1;j<=n;++j)
{
cin>>mat[i][j];
}
}
memset(dp,0,sizeof(dp));
for(int i=1;i<(1<<n);++i)
{
for(int j=1;j<=n;++j)
{
if(i&(1<<j-1))
{
dp[i]=max(dp[i],mat[__builtin_popcount(i)][j]+dp[i^(1<<j-1)]);
}
}
}
cout<<"Case "<<cnt++<<": "<<dp[(1<<n)-1]<<endl;
}
return 0;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKI2RlZmluZSBsbCBsb25nIGxvbmcKY29uc3QgaW50IE49MmU2KzUsbW9kPTFlOSs3OwoKaW50IG1hdFsyMF1bMjBdLGRwWygxPDwyMCldOwppbnQgbWFpbigpCnsKCWludCB0LGNudD0xO2Npbj4+dDsKCXdoaWxlKHQtLSkKCXsKCQlpbnQgbjtjaW4+Pm47CgkJZm9yKGludCBpPTE7aTw9bjsrK2kpCgkJewoJCQlmb3IoaW50IGo9MTtqPD1uOysraikKCQkJewoJCQkJY2luPj5tYXRbaV1bal07CgkJCX0KCQl9CgkJbWVtc2V0KGRwLDAsc2l6ZW9mKGRwKSk7CgkJZm9yKGludCBpPTE7aTwoMTw8bik7KytpKQoJCXsKCQkJZm9yKGludCBqPTE7ajw9bjsrK2opCgkJCXsKCQkJCWlmKGkmKDE8PGotMSkpCgkJCQl7CgkJCQkJZHBbaV09bWF4KGRwW2ldLG1hdFtfX2J1aWx0aW5fcG9wY291bnQoaSldW2pdK2RwW2leKDE8PGotMSldKTsKCQkJCX0KCQkJfQoJCX0KCQkKCQljb3V0PDwiQ2FzZSAiPDxjbnQrKzw8IjogIjw8ZHBbKDE8PG4pLTFdPDxlbmRsOwoJfQoJcmV0dXJuIDA7Cn0K