#include "bits/stdc++.h"
using namespace std;
using ll = short;
using bs = bitset<5000>;

const ll N = 5000 + 1;

ll n;
bs a[N], b[N];

void doTest(ll testID) {
    cin >> n;
    for (int i = 0; i < n; i ++) {
        string s; cin >> s;
        for (int j = 0; j < n; j ++)
            a[i][j] = b[j][i] = (s[j] - '0');
    }

    vector<ll> res;
    for (int i = 0; i < n; i ++) {
        bool ok = 1;
        for (int j = 0; j < n; j ++) {
            if (i == j) continue;
            if (a[i][j]) continue;
            if ((a[i] & b[j]).count()) continue;
            ok = 0;
            break;
        }
        if (ok) res.push_back(i);
        if (res.size() == 3) break;
    }

    if (res.size() < 3) cout << "NOT FOUND";
    else cout << res[0] + 1 << ' ' << res[1] + 1 << ' ' << res[2] + 1 << '\n';
}

signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0);

    int test = 1; 
    // cin >> test;
    for (int _ = 1; _ <= test; _ ++) doTest(test);
}