import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;

public class Tribune {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (sc.hasNextInt()) {
            int n = sc.nextInt();

            int[] poc = new int[26];
            int[] x = new int[26];
            int[] y = new int[26];
            char[][] p = new char[n][n];
            int z = 0;
            boolean b = false;
            for (int i = 0; i < n; i++) {
                String s = sc.next();
                HashSet<Character> h = new HashSet<>();
                p[i] = s.toCharArray();
                for (int k = 0; k < n; k++) {
                    h.add(s.charAt(k));
                    int index = (int) (s.charAt(k) - 'A');
                    poc[index]++;
                    x[index] = k;
                    y[index] = i;
                }
                if (h.size() != n) {
                    b = true;
                    z = i;
                }
            }

            if (b) {
                HashMap<Character, Integer> hm = new HashMap<>();
                for (int i = 0; i < n; i++) {
                    if (hm.containsKey(p[z][i])) {
                        int i1 = hm.get(p[z][i]);
                        int i2 = i;
                        int dobry = 0;
                        for (int j = 0; j < 26; j++) {
                            if (poc[j] == n-1) {
                                dobry = j;
                                break;
                            }
                        }
                        HashSet<Character> h = new HashSet<>();
                        for (int j = 0; j < n; j++) {
                            h.add(p[j][i1]);
                        }
                        if (h.size() == n) {
                            System.out.println((z + 1) + " " + (i2 + 1) + " " + (char) ('A' + dobry));
                        } else {
                            System.out.println((z + 1) + " " + (i1 + 1) + " " + (char) ('A' + dobry));
                        }
                    } else
                        hm.put(p[z][i], i);
                    
                }
                
            } else {
                int i1 = 0, i2 = 0;
                n--;
                for (int i = 0; i < 26; i++) {
                    if (poc[i] == 1) {
                        i1 = i;
                    }
                    if (poc[i] == n) {
                        i2 = i;
                    }

                }
                System.out.println((y[i1] + 1) + " " + (x[i1] + 1) + " " + (char) ('A' + i2));
            }
        }
    }
}