#include <fstream>

using namespace std;
const int NMAX = 12;
const int INF = 21e8;

ifstream cin("cast.in");
ofstream cout("cast.out");

///dp[mask][root] = tmin pt care calc. din mask sa PRIMEASCA informatia din root
int dp[(1 << NMAX) + 2][NMAX + 2];
int cost[NMAX + 2][NMAX + 2];
int n;

void backt(int mask1, int orig, int root, int pos) { ///mask1 e o chestie pe care o fm in PARALEL cu root
    if(pos == n) {
        int mask2 = orig - mask1;
        for(int i = 1; i <= n; i++) {
            if((1 << (i - 1)) & mask1) { ///il luam pe i ca ult nod la care se ajunge din mask1
                dp[orig][root] = min(dp[orig][root],
                                     max(dp[mask1][i] + cost[root][i], ///bifam tot mask1
                                         dp[mask2][root] + cost[root][i])); ///bifam tot mask2
            }
        }
        return;
    }
    if(root - 1 != pos && (orig & (1 << pos)))
        backt(mask1 + (1 << pos), orig, root, pos + 1); ///bagam un bit de 1
    backt(mask1, orig, root, pos + 1); ///bagam un bit de 0
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t;
    cin >> t;
    while(t--) {
        cin >> n;
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= n; j++)
                cin >> cost[i][j];

        ///INIT
        for(int mask = 0; mask < (1 << n); mask++) {
            for(int i = 1; i <= n; i++) {
                dp[mask][i] = INF;
            }
        }
        dp[0][0] = 0;
        dp[0][1] = 0;
        for(int i = 1; i <= n; i++) {
            dp[(1 << (i - 1))][i] = 0;
            /*for(int j = i + 1; j <= n; j++) {
                dp[(1 << (i - 1)) + (1 << (j - 1))][i] = cost[i][j];
                dp[(1 << (i - 1)) + (1 << (j - 1))][j] = cost[j][i];
            }*/
        }
        for(int mask = 1; mask < (1 << n); mask++) { ///RECURENTA
            int cati = __builtin_popcount(mask);
            if(cati == 1) ///dc e doar 1, n-avem cum sa dam split-ul
                continue;
            for(int root = 1; root <= n; root++) { ///root e IN mask
                if((mask & (1 << (root - 1))))
                    backt(0, mask, root, 0);
            }
            //if(mask == (1 << n) - 2)
                //break;
        }
        /*for(int mask = 0; mask < (1 << n); mask++) {
            for(int i = 1; i <= n; i++) {
                if(dp[mask][i] == INF)
                    cout << "- ";
                else
                    cout << dp[mask][i] << " ";
            }
            cout << '\n';
        }*/
        cout << dp[(1 << n) - 1][1] << '\n';
    }
    return 0;
}
/*
1
3
  0 104 117
108   0 118
113 113   0

  -   -   -
  0   -   -
  -   0   -
104 108   -
  -   -   0
117   - 113
  - 118 113
  -   -   -

221 = ans
*/