#include <cstdlib>
#include <cstdio>
#include <cstring>

#include <string>

int compar(const char* a, const char* b) {
	return *a -*b;
}

int main() {
	char buf[1000];
	int num;
	while (scanf("%d", &num) == 1) {
		char field[26][27];
		std::string origrows[26], rows[26];
		
		for (int i = 0; i<num;i++) {
			scanf("%s", field[i]);
			origrows[i] = field[i];
			qsort(field[i], num, 1, (int (*)(const void*, const void*))compar);
			rows[i] = field[i];
		}

		std::string a(field[0]), b(field[1]), c(field[2]), correct;
		if (b == c)
			correct = c;
		else
			correct = a;
	
		int index = 0;
		for ( ; index < num; index++ ) {
			if( correct != rows[index] )
				break;
		}
		
		int badIndex = 0;
		int remainingIndex;
		int hashRemaining = 0;
			
		for( int i = 0; i < num; i ++ )
		{
			bool flag = false;
			
			for( int j = 0; j < num; j ++ )
				if( origrows[index][i] == correct[j] )
				{
					flag = true;
					hashRemaining += correct[j];
				}
			if( ! flag )
				badIndex = i;
		}
		
		int hashFull = 0;
		for( int i = 0; i < num; i ++ )
			hashFull += correct[i];
		
		char ch = hashFull - hashRemaining;
		
		
		
		/*int i = 0;
		for( ; i < num; i ++ )
			if( correct[i] != rows[index][i] )
				break;

		char badchar = rows[index][i];
		int badcol = 0;
		for(;badcol<num;badcol++)
		    if (origrows[index][badcol] == badchar)
				break;*/

		printf( "%d %d %c\n", index+1, badIndex+1, ch );
		
	}
}