#include <iostream>

using namespace std;
const int N = 12, inf = 2e9;

int n, dp[1<<N][N], a[N+5][N+5];

void tc() {
    cin >> n;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
            cin >> a[i][j];

    dp[0][0] = 0;
    for(int mask=1; mask<(1<<n); mask++)
        for(int i=1; i<=n; i++) {
            if(mask & (1 << (i - 1))) {
                if(__builtin_popcount(mask) == 1)
                    dp[mask][i] = 0;
                else {
                    dp[mask][i] = inf;
                    for(int s=mask; s; s=(s-1)&mask)
                        if(!(s & (1 << (i - 1))))
                            for(int j=1; j<=n; j++)
                                if(s & (1 << (j - 1)))
                                    dp[mask][i] = min(dp[mask][i], max(dp[mask^s][i], dp[s][j]) + a[i][j]);
                }
            }
            else dp[mask][i] = 0;
        }

    cout << dp[(1<<n)-1][1] << '\n';
}

int main()
{
    freopen("cast.in", "r", stdin);
    freopen("cast.out", "w", stdout);
    cin.tie(nullptr)->sync_with_stdio(0);

    int tt;
    cin >> tt;
    while(tt--)
        tc();

    return 0;
}