#include #include int main(){ int n; while(scanf("%d\n", &n) != EOF){ char **tribune = (char**)malloc(n*sizeof(char*)); int i; int chary_count = 0; char *chary = (char*)calloc(n,sizeof(char)); int *chary_counter = (int*)calloc(n,sizeof(int)); for(i = 0; i < n; i++){ tribune[i] = (char*)calloc(n,sizeof(char)); } int u; char c; for(i = 0; i < n; i++){ for(u = 0; u < n; u++){ tribune[i][u] = getchar(); c = tribune[i][u]; int k = 0; short added = 0; for(k = 0; k < chary_count; k++){ if(chary[k] == c){ chary_counter[k]++; added = 1; } } if(added == 0){ chary[chary_count++] = c; chary_counter[chary_count-1] = 1; } } c = getchar(); } char john; for(i = 0; i < chary_count; i++){ if(chary_counter[i] == n-1 || chary_counter[i] == n + 1){ john = chary[i]; } } int column; int row; for(i = 0; i < n; i++){ int canbe = 1; for(u = 0; u < n; u++){ if(john == tribune[i][u]){ canbe = 0; } } if(canbe == 1){ row = i; } } for(i = 0; i < n; i++){ int canbe = 1; for(u = 0; u < n; u++){ if(john == tribune[u][i]){ canbe = 0; } } if(canbe == 1){ column = i; } } printf("%d %d %c\n", row+1, column+1, john); } return 0; }