/* 
 * File:   baloon.cpp
 * Author: cteam022
 *
 * Created on October 22, 2016, 9:21 AM
 */

#include <cstdlib>
#include <iostream>
#include <string>
#include <algorithm>
#include <unordered_set>

using namespace std;


#define FOR(i,n) for(int i=0;i<n;i++)
#define FOR1(i,n) for(int i=1;i<=n;i++)

/*
 * 
 */

    
 /*   
int preved(string s){
    int cislo=0;
    sort(s.begin(),s.end());
    auto last = std::unique(s.begin(), s.end());
    // v now holds {1 2 3 4 5 6 7 x x x x x x}, where 'x' is indeterminate
    s.erase(last, s.end()); 
    FOR(i,s.size()){
        cislo=cislo*10+s[i]-'0';
            
    }
    
    //cout<<cislo<<endl;
    return cislo;
}    */
    
int main() {
    ios::sync_with_stdio(false);
    //cin.tie(0);
    int n, m, k;
    while(cin>>n){
        int cnt[30];  
        FOR(i,30) {
            cnt[i]=0;
        }
        vector<string> s; 
        FOR(i,n) {
            string s1;
            cin >> s1;
            FOR(j,n) {
                cnt[s1[j]-'A']++;
            }
            s.push_back(s1);
        }
        int id1, id2;
        bool one=false;
        FOR(i,26) {
            if (cnt[i] == n+1)
                id1=i;
            else if (cnt[i] == 1) {
                one = true;
                id1=i;
            }
            else if (cnt[i] == n-1)
                id2=i;
        }
        
        if (one) {
            int r, c; 
            bool found = false;
            FOR(i,n) {
                if (found)
                    break;
                FOR (j,n) {
                    if (s[i][j]== char(id1+'A')) {
                        r=i;
                        c=j;
                        found = true;
                        break;
                    }
                }
            }
            cout << r+1 << " " << c+1 << " " << (char)('A'+id2) << endl;
        }
        else {
            //rada
            int lcnt=0;
            int i=0;
            while (lcnt <2) {
                lcnt=0;
                FOR(j,n) {
                    if(s[i][j] == char(id1+'A')) {
                        lcnt++;
                    }
                }
                i++;
            }
            //sloupec
            lcnt=0;
            int k=0;
            while (lcnt <2) {
                lcnt=0;
                FOR(j,n) {
                    if(s[j][k] == char(id1+'A')) {
                        lcnt++;
                    }
                }
                k++;
            }
            cout << i << " " << k << " " << (char)('A'+id2) << endl;
        }
    }
    return 0;
}