#include<algorithm>
#include<bitset>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<deque>
#include<fstream>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<utility>
#include<vector>

using namespace std;

#define dbg(x) (cout<<#x<<" = "<<(x)<<'\n')
const string problemName = "cast";
const string inputFile = problemName + ".in";
const string outputFile = problemName + ".out";

typedef long long int lld;
typedef pair<int, int> PII;

const int INF = (1LL << 30) - 1;
const lld LINF = (1LL << 62) - 1;

int T, N, P;
int A[15][15];
int DP[(1 << 12) + 5][15];
bool viz[(1 << 12) + 5][15];

int dp(int mask, int root) {
    if((mask ^ (mask & (-mask))) == 0)
        return 0;

    if(viz[mask][root])
        return DP[mask][root];

    int m, r;

    DP[mask][root] = INF;
    viz[mask][root] = 1;

    for(m = 0; m < mask; m++)
        if((m | mask) == mask && !((1 << root)&m))
            for(r = 0; r < N; r++)
                if((1 << r) & m)
                    DP[mask][root] = min(DP[mask][root], A[root][r] + max(dp(m, r), dp(mask ^ m, root)));

    return DP[mask][root];
}

void solve() {
    int i, j;

    scanf("%d", &N);

    for(i = 0; i < N; i++)
        for(j = 0; j < N; j++)
            scanf("%d", &A[i][j]);

    P = (1 << N) - 1;

    printf("%d\n", dp(P, 0));
}

int main() {
#ifndef ONLINE_JUDGE
    freopen(inputFile.c_str(), "r", stdin);
    freopen(outputFile.c_str(), "w", stdout);
#endif

    scanf("%d", &T);

    while(T--) {
        memset(viz, 0, sizeof(viz));
        solve();
    }

    return 0;
}