#include <iostream>

#include <cstdio>

#include <sstream>

#include <cstring>

#include <map>

#include <cctype>

#include <set>

#include <vector>

#include <stack>

#include <queue>

#include <algorithm>

#include <cmath>

#include <bitset>

#define rap(i, a, n) for(int i=a; i<=n; i++)

#define rep(i, a, n) for(int i=a; i<n; i++)

#define lap(i, a, n) for(int i=n; i>=a; i--)

#define lep(i, a, n) for(int i=n; i>a; i--)

#define rd(a) scanf("%d", &a)

#define rlld(a) scanf("%lld", &a)

#define rc(a) scanf("%c", &a)

#define rs(a) scanf("%s", a)

#define pd(a) printf("%d\n", a);

#define plld(a) printf("%lld\n", a);

#define pc(a) printf("%c\n", a);

#define ps(a) printf("%s\n", a);

#define MOD 2018

#define LL long long

#define ULL unsigned long long

#define Pair pair<int, int>

#define mem(a, b) memset(a, b, sizeof(a))

#define _  ios_base::sync_with_stdio(0),cin.tie(0)

//freopen("1.txt", "r", stdin);

using namespace std;

const int maxn = 1e6 + , INF = 0x7fffffff, LL_INF = 0x7fffffffffffffff;

int n, s, t;

int head[maxn], d[maxn], vis[maxn];

int cnt;

struct node

{

    int u, v, w, next;

}Node[maxn << ];

void add_(int u, int v, int w)

{

    Node[cnt].u = u;

    Node[cnt].v = v;

    Node[cnt].w = w;

    Node[cnt].next = head[u];

    head[u] = cnt++;

}

void add(int u, int v, int w)

{

    add_(u, v, w);

    add_(v, u, w);

}

void spfa()

{

    queue<int> Q;

    for(int i = ; i < maxn; i++) d[i] = INF;

    mem(vis, );

    Q.push(s);

    vis[s] = ;

    d[s] = ;

    while(!Q.empty())

    {

        int u = Q.front(); Q.pop();

        vis[u] = ;

        for(int i = head[u]; i != -; i = Node[i].next)

        {

            node e = Node[i];

            if(d[e.v] > d[u] + e.w)

            {

                d[e.v] = d[u] + e.w;

                if(!vis[e.v])

                {

                    vis[e.v] = ;

                    Q.push(e.v);

                }

            }

        }

    }

}

void init()

{

    mem(head, -);

    cnt = ;

}

int main()

{

    int T, w;

    rd(T);

    while(T--)

    {

        init();

        rd(n);

        s = , t = n * n + ;

        for(int i = ; i < n; i++)

            for(int j = ; j <= n; j++)

            {

                rd(w);

                if(i == )

                {

                    if(j == )

                        add(s, i * (n - ) + j, w), add(i * (n - ) + j, t, w);

                    else if(j == n)

                        add(i * (n - ) + (j - ), t, w);

                    else

                        add(i * (n - ) + j, i * (n - ) + (j - ), w), add(i * (n - ) + j, t, w);

                }

                else if(i == n - )

                {

                    if(j < n)

                        add(s, (i - ) * (n - ) + j, w);

                }

                else

                {

                    if(j == )

                        add(s, i * (n - ) + j, w), add(i * (n - ) + j, (i - ) * (n - ) + j, w);

                    else if(j == n)

                        add(i * (n - ) + (j - ), t, w);

                    else

                        add(i * (n - ) + j, i * (n - ) + (j - ), w), add(i * (n - ) + j, (i - ) * (n - ) + j, w);

                }

            }

        spfa();

        printf("%d\n", d[t]);

    }

    return ;

}