#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define ov3(a, b, c, name, ...) name
#define rep0(n) for(ll aaaaa = 0; aaaaa < (n); aaaaa++)
#define rep1(i, n) for(ll i = 0; i < (n); i++)
#define rep2(i, a, b) for(ll i = (a); i < (b); i++)
#define rep(...) ov3(__VA_ARGS__, rep2, rep1, rep0)(__VA_ARGS__)
#define per(i, a, b) for(ll i = (a) - 1; i >= b; i--)
#define fore(e, v) for(auto &&e : v)
#define all(a) begin(a), end(a)
#define si(a) (int)(size(a))
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define eb emplace_back
template <typename T, typename S> bool chmin(T &a, S &b) { return a > b ? a = b, true : false; }
template <typename T, typename S> bool chmax(T &a, S &b) { return a < b ? a = b, true : false; }

const int INF = 1e9 + 100;
const ll INFL = 3e18 + 100;

#define i128 __int128_t

struct _ {
    _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }
} __;

int main() {
    int n;
    cin >> n;
    vector<vi> g(n, vi(n));
    rep(i, n) rep(j, n) {
        char c;
        cin >> c;
        g[i][j] = c == '1';
    }

    vi sum(n);
    rep(i, n) sum[i] = accumulate(all(g[i]), 0);

    vi id(n);
    iota(all(id), 0);
    sort(all(id), [&](int i, int j) { return sum[i] > sum[j]; });

    vi res;
    fore(i, id) {
        bool ok = true;
        fore(j, res) {
            bool flag = true;
            rep(k, n) {
                if(g[i][k]) flag &= g[j][k];
            }
            if(flag) {
                ok = false;
                break;
            }
        }
        if(ok) res.eb(i);
        if(si(res) == 3) break;
    }
    if(si(res) < 3)
        cout << "NOT FOUND" << endl;
    else { cout << res[0] + 1 << " " << res[1] + 1 << " " << res[2] + 1 << endl; }
}