#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define PII pair<int,int>
#define endl '\n'
typedef long long LL;
const int N = 5e3 + 10, mod = 1e9 + 7;
int n, cnt[N];
string s[N];
void solve() {   
    cin >> n;
    int mx = 0;
    for (int i = 1;i <= n;i++) {
        cin >> s[i];
        for (auto v : s[i]) cnt[i] += v == '1';
        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 = 0;i < n;i++) {
            if (s[x][i] == '0' and s[y][i] == '1') return 1;
        }
        return 0;
    };

    int tot = 2;
    while (ans.size() < 3 and tot--) {
        int mx = 0, id;
        for (int i = 1;i <= n;i++) {
            bool ok = 1;
            for (auto v : ans) {
                ok &= check(v, i);
            }
            if (ok and cnt[i] > mx) {
                mx = cnt[i];
                id = i;
            }
        }
        if (mx) ans.push_back(id);
        else break;
    }
    if (ans.size() < 3) {
        cout << "NOT FOUND\n";
    }
    else cout << ans[0] << " " << ans[1] << " " << ans[2] << endl;
}
signed main(void) {
#ifdef a6z
    freopen("in.txt", "r", stdin), freopen("out.txt", "w", stdout);
#endif
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int tt = 1;
    //cin >> tt;
    while (tt--) {
        solve();
    }
    return 0;
}