#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


int N;
int A[210][210];

struct Op {
  int i0, j0, i1, j1;
};
int ansLen;
Op ans[20010];

namespace sub1 {
bool validate() {
  for (int i = 0; i < N; ++i) for (int j = 0; j < N; ++j) {
    if (A[i][0] != A[i][j]) return false;
  }
  return true;
}
void run() {
  for (int i = 0; i < N; ++i) for (int j = i + 1; j < N; ++j) {
    ans[ansLen++] = Op{i, j, j, i};
  }
}
}  // sub1

namespace sub2 {
vector<int> P, Q, J;
bool validate() {
  assert(N >= 2);
  P.assign(N, -1);
  Q.assign(N, -1);
  J.assign(N, -1);
  for (int i = 0; i < N; ++i) {
    vector<int> freq(N, 0);
    for (int j = 0; j < N; ++j) {
      ++freq[A[i][j]];
    }
    P[i] = max_element(freq.begin(), freq.end()) - freq.begin();
    if (freq[P[i]] == N) {
      Q[i] = P[i];
      J[i] = 0;
    } else if (freq[P[i]] == N - 1) {
      for (int j = 0; j < N; ++j) if (P[i] != A[i][j]) {
        Q[i] = A[i][j];
        J[i] = j;
        break;
      }
      assert(~Q[i]);
    } else {
      return false;
    }
  }
cerr<<"[sub2] P = "<<P<<", Q = "<<Q<<", J = "<<J<<endl;
  return true;
}
bool adj[210][210];
void run() {
  vector<int> invP(N, -1), invQ(N, -1);
  for (int i = 0; i < N; ++i) {
    invP[P[i]] = i;
    invQ[Q[i]] = i;
  }
  vector<vector<int>> jss(N);
  for (int i = 0; i < N; ++i) {
    for (int j = 0; j < N; ++j) if (J[i] != j) {
      jss[i].push_back(j);
    }
    jss[i].push_back(J[i]);
  }
  for (int k = 0; k < N - 2; ++k) {
    // size N-k
    const int spe = invQ[A[k][jss[k][N - 1]]];
// cerr<<"k = "<<k<<", N-k = "<<N-k<<", spe = "<<spe<<endl;
// cerr<<"  jss = "<<jss<<endl;
    int pos = k + 1;
    for (int i = k + 1; i < N; ++i) if (spe != i) {
      ans[ansLen++] = Op{k, jss[k][pos++], i, jss[i][k]};
    }
    if (k != spe) {
      assert(pos == N - 1);
      ans[ansLen++] = Op{k, jss[k][pos++], spe, jss[spe][k]};
      rotate(jss[spe].begin() + k, jss[spe].begin() + (N - 1), jss[spe].end());
    }
  }
}
}  // sub1

int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%d", &N);
    for (int i = 0; i < N; ++i) for (int j = 0; j < N; ++j) {
      scanf("%d", &A[i][j]);
      --A[i][j];
    }
    
    ansLen = 0;
    if (sub1::validate()) {
      sub1::run();
    } else if (sub2::validate()) {
      sub2::run();
    } else {
      // HELP
      puts("-1");
      continue;
    }
    
    printf("%d\n", ansLen);
    for (int h = 0; h < ansLen; ++h) {
      printf("%d %d %d %d\n", ans[h].i0 + 1, ans[h].j0 + 1, ans[h].i1 + 1, ans[h].j1 + 1);
    }
#ifdef LOCAL
int oped[210][210]={};
for(int h=0;h<ansLen;++h){
 assert(!oped[ans[h].i0][ans[h].j0]++);
 assert(!oped[ans[h].i1][ans[h].j1]++);
 swap(A[ans[h].i0][ans[h].j0],A[ans[h].i1][ans[h].j1]);
}
cerr<<"A = "<<endl;for(int i=0;i<N;++i)pv(A[i],A[i]+N);
for(int i=0;i<N;++i){
 vector<int>freq(N,0);
 for(int j=0;j<N;++j)++freq[A[i][j]];
 for(int a=0;a<N;++a)assert(freq[a]==1);
}
#endif
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}