#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
typedef long long ll;
typedef long double ld;
#define IN(n) int n; scanf("%d", &(n));
#define FOR(i, m, n) for (int i(m); i<n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
char s[32][32];
int C[32],R[32],N,f[32];
int mis(){
    F(26)if(f[i]==N-1)return i;
    assert(0);
}
void one(char c){
    F(N)FF(N)if(s[i][j]==c){
        printf("%d %d",i+1,j+1);
        return;
    }
    assert(0);
}
int main() {
    while(~scanf("%d",&N)){
        F(N)scanf("%s",s[i]);
        CL(C,0),CL(R,0),CL(f,0);
        F(N)FF(N)if(++f[s[i][j]-65]);
        F(26)if(f[i]==1){
            one(i+65);
            goto GOW;
        }
        F(26)if(f[i]==N+1){
            FT(0,N)FF(N)if(s[k][j]==i+65)++C[k],++R[k];
            FT(0,N)if(C[k]==2)FF(N)if(R[j]==2){
                printf("%d %d",k+1,j+1);
                goto GOW;
            }
        }
        assert(0);
        GOW:
        printf(" %c\n",mis()+65);
    }
    return 0;
}