#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=2e9+1;
const ll INF=4e18;
const ll dy[8]={-1,0,1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}
bool iskd(ll a,ll b,ll c){
  if(a==b||b==c||c==a)return false;
  if(a<b&&b>c)return true;
  if(a>b&&b<c)return true;
  return false;
}
bool isok(vvl mat){
  rep(i,3)rep(j,3)if(mat[i][j]<=0)return false;
  bool ok=true;
  rep(i,3){
    ok&=iskd(mat[i][0],mat[i][1],mat[i][2]);
  }
  rep(i,3){
    ok&=iskd(mat[0][i],mat[1][i],mat[2][i]);
  }
  ok&=iskd(mat[0][0],mat[1][1],mat[2][2]);
  ok&=iskd(mat[0][2],mat[1][1],mat[2][0]);
  return ok;
}
void solve(){
  ll n;cin >> n;
  vvl mat(3,vl(3));
  vl x,y;
  rep(i,3){
    rep(j,3){
      cin >> mat[i][j];
      if(mat[i][j]==0){
        x.push_back(i);y.push_back(j);
      }
    }
  }
  vl st={1,n-1,n};
  rep(i,3)rep(j,3){
    st.push_back(mat[i][j]-1);
    st.push_back(mat[i][j]);
    st.push_back(mat[i][j]+1);
    st.push_back(n-mat[i][j]-1);
    st.push_back(n-mat[i][j]);
    st.push_back(n-mat[i][j]+1);
  }
  sort(all(st));st.erase(unique(all(st)),st.end());
  //for(auto p:st)cout << p <<" ";cout << endl;
  ll ans=0;
  rep(i,st.size()-1){
    mat[x[0]][y[0]]=st[i];
    mat[x[1]][y[1]]=n-st[i];
    if(isok(mat)){
      ans+=st[i+1]-st[i];
      //cout << st[i] << endl;
    }
  }
  cout << ans << endl;
  /*ll ret=0;
  for(int i=1;i<n-1;i++){
    mat[x[0]][y[0]]=i;
    mat[x[1]][y[1]]=n-i;
    if(isok(mat)){
      //cout << i << endl;
      ret++;
    }
  }
  cout << ret << endl;*/
}
int main(){
  ll t;cin >> t;
  while(t--){
    solve();
  }
}