#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
const int N = 5000 + 10;
const int maxn = 1e5 + 10;
const int inf = 0x3f3f3f3f;

// 竞赛图 : 每两个顶点之间都有一条边相连（有向完全图）

int cnt[N];

char s[N][N];

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    int mx = 0;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            char ch;
            cin >> ch;
            s[i][j] = ch;
            if (ch == '1')
                cnt[i]++;
            mx = max(mx, cnt[i]);
        }
    }

    vector<int> ans;
    for (int i = 1; i <= n; i++)
    {
        if (cnt[i] == mx)
            ans.push_back(i);
    }

    auto check = [&](int x, int y)
    {
        for (int i = 1; i <= n; i++)
        {
            if (s[x][i] == '1' && s[y][i] == '0')
                return true;
        }
        return false;
    };

    int tot = 2;
    while (tot--)
    {
        int mx = 0, pos = 0;
        for (int i = 1; i <= n; i++)
        {
            bool ok = 1;
            for (auto x : ans)
                ok &= check(i, x);
            if (ok && cnt[i] > mx)
            {
                mx = cnt[i];
                pos = i;
            }
        }
        if (mx)
            ans.push_back(pos);
        else
            break;
    }
    if (ans.size() < 3)
        cout << "NOT FOUND" << endl;
    else
        cout << ans[0] << ' ' << ans[1] << ' ' << ans[2] << endl;
}