#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pr;
const double pi=acos(-1);
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,n,a) for(int i=n;i>=a;i--)
#define Rep(i,u) for(int i=head[u];i;i=Next[i])
#define clr(a) memset(a,0,sizeof a)
#define pb push_back
#define mp make_pair
#define fi first
#define sc second
ld eps=1e-9;
ll pp=1000000007;
ll mo(ll a,ll pp){if(a>=0 && a<pp)return a;a%=pp;if(a<0)a+=pp;return a;}
ll powmod(ll a,ll b,ll pp){ll ans=1;for(;b;b>>=1,a=mo(a*a,pp))if(b&1)ans=mo(ans*a,pp);return ans;}
ll read(){
    ll ans=0;
    char last=' ',ch=getchar();
    while(ch<'0' || ch>'9')last=ch,ch=getchar();
    while(ch>='0' && ch<='9')ans=ans*10+ch-'0',ch=getchar();
    if(last=='-')ans=-ans;
    return ans;
}
//head
#define N 3100
int fa[N],lab[N],low[N],vis[N],tim,head[N],v[N*N],Next[N*N],num=1,ans,m=0,q[N*N*2];
bool p[N*N*2];
void add(int x, int y){
    v[++num]=y;Next[num]=head[x];head[x]=num;p[num]=0;
//    printf("%d %d\n",x,y);
}
struct node{
    int x,y,z;
}a[N*N];
bool cmp(node a,node b){
    return a.z<b.z;
}
void dfs(int u){
//    printf("into %d\n",u);
    vis[u]=1;
    lab[u]=low[u]=++tim;
    for(int i=head[u];i;i=Next[i])
        if(!p[i]){
        p[i]=p[i^1]=1;
        if(!vis[v[i]]){
            dfs(v[i]);
            if(low[v[i]]>lab[u])++ans;
            low[u]=min(low[u],low[v[i]]);
        }
        else low[u]=min(low[u],lab[v[i]]);
        }
    //cout<<"out "<<u<<" "<<low[u]<<endl;
}
int find(int x){
    if(fa[x]==x)return x;
    return fa[x]=find(fa[x]);
}
int main(){
    int T=read();
    while(T--){
        int n=read();
        m=0;
        rep(i,1,n)
            rep(j,1,n-i){
                a[++m].x=i;
                a[m].y=i+j;
                a[m].z=read();
            }
        sort(a+1,a+m+1,cmp);
        rep(i,1,n)fa[i]=i;
        ans=0;
        rep(i,1,m){
            int t=i;
            while(i<m && a[i+1].z==a[i].z)++i;
            q[0]=0;tim=0;
        //    cout<<t<<" "<<i<<endl;
            num=1;
        //    printf("%d %d %d %d\n",fa[1],fa[2],fa[3],fa[4]);
            rep(j,t,i){
                int fx=find(a[j].x),fy=find(a[j].y);
                if(fx!=fy){
                    add(fx,fy);add(fy,fx);
                    q[++q[0]]=fx;
                    q[++q[0]]=fy;
                    }
            }
            rep(j,1,q[0])
                if(!vis[q[j]])dfs(q[j]);
            rep(j,1,q[0])head[q[j]]=0,vis[q[j]]=0;num=1;
            rep(j,t,i){
                int fx=find(a[j].x),fy=find(a[j].y);
                fa[fx]=fy;
            }
        }
        cout<<ans<<endl;
    }
    return 0;
}