#include "bits/stdc++.h"
using namespace std;

#define ll long long
#define MOD ((int) (1e9) + 7)
#define pii pair<int, int>

#define N 5050

int adj[N][N], outd[N];

vector<int> S(int u, int n) {
    vector<int> res;
    for (int i = 1; i <= n; ++ i) if (adj[i][u]) res.emplace_back(i);
    return res;
}

int dominant(vector<int> s) {
    memset(outd, 0, sizeof outd);
    for (auto u : s) {
        for (auto v : s) {
            if (adj[u][v]) outd[u] ++;
        }
    }

    int res, deg = -1;
    for (auto u : s) if (outd[u] > deg) deg = outd[u], res = u;

    return res;
}

int main() {
#ifdef TEST
    freopen("zz.in", "r+", stdin);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n; cin >> n;
    vector<int> cur;

    for (int i = 1; i <= n; ++ i) {
        string s; cin >> s;
        cur.emplace_back(i);
        for (int j = 1; j <= n; ++ j) {
            adj[i][j] = s[j-1] - '0';
        }
    }

    int a = dominant(cur);
    cur = S(a, n);   
    if (cur.empty()) {
        cout << "NOT FOUND\n";
        return 0;
    } 

    int b = dominant(cur);
    cur = S(b, n);
    if (cur.empty()) {
        cout << "NOT FOUND\n";
        return 0;
    } 

    int c = dominant(cur);

    cout << a << ' ' << b << ' ' << c << '\n';
    
    return 0;
}