#include <bits/stdc++.h>

using namespace std;

const char N = 26;


string arr[N];
int rows[N], cols[N];


int calcRow(int row, int n)
{
    int result = 0;
    for(int i = 0; i < n; i++)
        result += arr[row][i];

    return result;
}

int calcCol(int col, int n)
{
    int result = 0;
    for(int i = 0; i < n; i++)
        result += arr[i][col];

    return result;
}

int findGood(int a, int b, int c)
{
    int arr[3] = {a,b,c};
    sort(arr, arr + 3, [] (int x, int y){return x > y;});
    return arr[1];
}

int main()
{
    int n;
    while(cin >> n)
    {
        string tmp;
        getline(cin, tmp);
        for(int i = 0; i < n; i++)
        {
            getline(cin, arr[i]);
        }

        for (int i =0; i < n; i++) {
            rows[i] = calcRow(i, n);
            cols[i] = calcCol(i, n);
        }

        int goodRow = findGood(rows[0], rows[1], rows[2]);
        int goodCol = findGood(cols[0], cols[1], cols[2]);

        int invalidRow = 0;
        int invalidCol = 0;
        for (int i =0; i < n; i++) {
            if(goodRow != rows[i])
                {

                    invalidRow = i;
                    break;
                }
        }

        for (int i =0; i < n; i++) {
            if(goodCol!= cols[i])
                {
                    invalidCol = i;
                    break;
                }
        }

        //cout << invalidRow << " " << invalidCol << endl;

        int diff = rows[invalidRow] - goodRow;

        //cout << (char)(arr[invalidRow][invalidCol] - diff) << endl;

        //invalidCol++;
        //invalidRow++;
        cout << invalidRow  + 1<< " " << invalidCol + 1<< ' ' << (char)(arr[invalidRow][invalidCol] - diff) << endl;
        // TODO: add 1 to result
    }
    return 0;
}