#include <cstdio>
#include <cstring>
#define MAXN 26
#define MIN(X, Y) ((X) < (Y)) ? (X) : (Y)


using namespace std;

int sumrow(char str[]){
	int sum = 0;
	for (unsigned int i=0; i<strlen(str); ++i)
		sum += str[i];
	return sum;
}

int sumcol(char str[MAXN+1][MAXN+1], int i, int N){
	int sum = 0;
	for (int j=0; j<N; ++j){
		sum += str[j][i];
	}
	return sum;
}

int main(){
	int N;
	
	while (scanf("%d\n", &N) != -1){
		int sum = 0;
		int sum_a = 0, sum_b = 0, a_n = 1, b_n = 0, badrow, badcol, sum_badrow, sum_badcol, sum_goodrow;

		char tribune[MAXN+1][MAXN+1];
		for (int i=0; i<N; ++i){
			scanf("%s\n", tribune[i]);
		}
		sum_a = sumrow(tribune[0]); // first row sum
		for (int i=1; i<N; ++i){
			if ((sum = sumrow(tribune[i])) == sum_a){
				a_n++;
			} else {
				sum_b = sum;
				b_n++;
				badrow = i;
			}
			if ((MIN(a_n, b_n) > 0) && (a_n != b_n)){ // distinction found
				if (a_n == 1) {
					badrow = 0;
					sum_badrow = sum_a;
					sum_goodrow = sum_b;
				} else {
					sum_badrow = sum_b;
					sum_goodrow = sum_a;
				}
				// find column here
				for (int j=0; j<N; ++j){
					if (sumcol(tribune, j, N) == sum_badrow){
						badcol = j;
						break;
					}
				}
				// write output for this input
				printf("%d %d %c\n", badrow+1, badcol+1, tribune[badrow][badcol]-(sum_badrow - sum_goodrow));
				break;
			}
		}
	}
	
	return 0;
}