CodeChef::ADAMATRIX

//   LOGIC:-ADAMATRIX
// matrix contains no from 1 to n^2  so  the last element 
// will be  n^2 and previous element is n^2 -1 and so on.
// If last and second last element are not in order then
// transpose the matrix and go up for similar Process.

#include <bits/stdc++.h>
using namespace std ;

int main(){
    int t ;
    cin >> t ;
    while(t--){
        int n ;
        cin >> n ;
        vector<vector<int>> v;
        for(int i = 0;i<n;i++){
            vector<int> temp ;
            for(int j = 0;j<n;j++){
                int a ;
                cin >> a ;
                temp.push_back(a);

            }
            v.push_back(temp);
        }
        int count{0};
        for(int i = n - 1 ;i>0;i--){
            if(v[i][i] != v[i][i-1] + 1 ){
                count ++ ;
                for(int x=0;x<i+1;x++){
                    for(int y = x;y<i+1;y++){
                        swap(v[x][y],v[y][x]);
                    }

                }
            }
            else{
                continue;
            }

        }
        cout << count << '\n';

    }


    return 0 ;
}