/**/
    import java.io.*;
    import java.util.*;
    import java.text.*; 
    import java.lang.*;
    import java.math.*;
public class Main{
/*********************************************Constants***********************************/
    static PrintWriter out=new PrintWriter(new OutputStreamWriter(System.out));        
    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    static long mod=(long)1e9+7;
    static long mod1=998244353;
    static ArrayList<Integer> graph[];
    static int pptr=0,pptrmax=0;
    static String st[];
/*****************************************Solution Begins*********************************/
    
    public static void main(String args[]) throws Exception{
        int tt=pi();
        while(tt-->0){
            int n=pi();
            char input[][]=new char[n][];
            for(int i=0;i<n;i++){
                input[i]=ps().toCharArray();
            }
            int a1=input[0][1]-'0';
            int a2=input[1][0]-'0';
            int a3=input[n-1][n-2]-'0';
            int a4=input[n-2][n-1]-'0';
            ArrayList<Pair> ans=new ArrayList<>();
            if(a1 == a2){
                if(a3==a1){
                    ans.add(new Pair(n,n-1));
                }
                if(a4==a1){
                    ans.add(new Pair(n-1,n));
                }
            }
            else if(a3==a4){
                if(a1==a3){
                    ans.add(new Pair(1,2));
                }
                if(a2==a3){
                    ans.add(new Pair(2,1));
                }
            }
            else{
                ans.add(new Pair(2,1));
                if(a3==a1){
                    ans.add(new Pair(n,n-1));
                }
                if(a4==a1){
                    ans.add(new Pair(n-1,n));
                }
            }
            out.println(ans.size());
            for(Pair p:ans)out.println(p.u+" "+p.v);
        }
/****************************************Solution Ends*************************************/
        clr();
    }
    static void clr(){
        out.flush();
        out.close();
    }
    static void nl() throws Exception{
        pptr=0;
        st=br.readLine().split(" ");
        pptrmax=st.length;
    }
    static void nls() throws Exception{
        pptr=0;
        st=br.readLine().split("");
        pptrmax=st.length;
    }
    static int pi() throws Exception{
        if(pptr==pptrmax)
            nl();
        return Integer.parseInt(st[pptr++]);
    }
    static long pl() throws Exception{
        if(pptr==pptrmax)
            nl();
        return Long.parseLong(st[pptr++]);
    }
    static double pd() throws Exception{
        if(pptr==pptrmax)
            nl();
        return Double.parseDouble(st[pptr++]);
    }
    static String ps() throws Exception{
        if(pptr==pptrmax)
            nl();
        return st[pptr++];
    }
/***************************************Precision Printing*********************************/
        static void printPrecision(double d){
            DecimalFormat ft = new DecimalFormat("0.00000000000"); 
            out.println(ft.format(d));
        }
/**************************************Bit Count************************************/
    static int countBit(long mask){
        int ans=0;
        while(mask!=0){
            mask&=(mask-1);
            ans++;
        }
        return ans;
    }
/******************************************Graph******************************************/
    static void Makegraph(int n){
        graph=new ArrayList[n];
        for(int i=0;i<n;i++)
            graph[i]=new ArrayList<>();
    }
    static void addEdge(int a,int b){
        graph[a].add(b);
    }
    // static void addEdge(int a,int b,int c){
    //     graph[a].add(new Pair(b,c));
    // }    
/******************************************Pair*****************************************/
    static class Pair{
        int u;
        int v;
        public Pair(int u, int v) {
            this.u = u;
            this.v = v;
        }
        public int hashCode() {
            int hu = (int) (u ^ (u >>> 32));
            int hv = (int) (v ^ (v >>> 32));
            return 31 * hu + hv;
        }
        public boolean equals(Object o) {
            Pair other = (Pair) o;
            return u == other.u && v == other.v;
        }
        public String toString() {
            return "[u=" + u + ", v=" + v + "]";
        }
    }
/*****************************************DEBUG********************************************/
    public static void debug(Object... o){
        System.err.println(Arrays.deepToString(o));
    }
/************************************Modular Exponentiation********************************/
    static long modulo(long a,long b,long c){
        long x=1,y=a%c;
        while(b > 0){
            if(b%2 == 1)
                x=(x*y)%c;
            y = (y*y)%c;
            b = b>>1;
        }
        return  x%c;
    }
/********************************************GCD*******************************************/
    static long gcd(long x, long y){
        if(x==0)
            return y;
        if(y==0)
            return x;
        long r=0, a, b;
        a = (x > y) ? x : y; 
        b = (x < y) ? x : y;
        r = b;
        while(a % b != 0){
            r = a % b;
            a = b;
            b = r;
        }
        return r;
    }
}