#include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char* x) { cerr << '\"' << x << '\"'; }
void __print(const string& x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V>& x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T>
void __print(const T& x) {
  int f = 0;
  cerr << '{';
  for (auto& i : x) cerr << (f++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cerr << ", ";
  _print(v...);
}
void IO() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
long long int n;
void solve() {
  cin >> n;
  vector<string> gr(n);
  for (int i = 0; i < n; i++) {
    cin >> gr[i];
  }
  char a, b, c, d;
  a = gr[0][1];
  b = gr[1][0];
  c = gr[n - 1][n - 2];
  d = gr[n - 2][n - 1];
  vector<pair<long long, long long> > ans;
  if (a == b) {
    if (c == a) ans.push_back({n, n - 1});
    if (d == a) ans.push_back({n - 1, n});
  } else {
    ans.push_back({2, 1});
    if (c == a) ans.push_back({n, n - 1});
    if (d == a) ans.push_back({n - 1, n});
  }
  cout << ans.size() << "\n";
  for (auto p : ans) {
    cout << p.first << " " << p.second << "\n";
  }
}
int main() {
  IO();
  ;
  int t = 1;
  cin >> t;
  while (t--) {
    solve();
  };
  return 0;
}
