#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, n) for (int i=(a); i < (n); i++)
#define per(i, a, n) for (int i=(n)-1; i >= (a); i--)
#define ll long long

string getOrig(vector<string> v){
	rep(i,0,3) sort(v[i].begin(), v[i].end());
	rep(i,0,3) if(v[i]==v[(i+1)%3]) return v[i];
	assert(false);
}

int main(void){
	int n;
	while(cin>>n){
		vector<string> v(n);
		rep(i,0,n)cin>>v[i];
		string rows = getOrig(v);
		vector<string> v2(n, string(n, '#'));
		rep(i,0,n) rep(j,0,n) v2[i][j] = v[j][i];
		string cols = getOrig(v2);
		int r = -1;
		rep(i,0,n) {
			string cur = v[i];
			sort(cur.begin(), cur.end());
			if(cur != rows) {
				r = i;
				break;
			}
		}
		assert(r!=-1);
		int c = -1;
		rep(i,0,n) {
			string cur = v2[i];
			sort(cur.begin(), cur.end());
			if(cur != cols) {
				c = i;
				break;
			}
		}
		assert(c!=-1);
		char ch = 'x';
		rep(i,0,26) {
			v[r][c] = 'A'+i;
			string cur = v[r];
			sort(cur.begin(), cur.end());
			if(cur == rows) {
				ch = v[r][c];
				break;
			}
		}
		assert(ch !='x');
		cout << (r+1) << " " << (c+1) << " " << ch<< endl;
	}
	return 0;
}