#include<bits/stdc++.h>
#define ios ios::sync_with_stdio(0), cin.tie(0)
#define time chrono::system_clock::now().time_since_epoch().count()
using namespace std;
using ll = long long;
using pll = pair<int, int>;

const int mod = 1e9 + 7, N = 2e5 + 10;

void solve(){
    int n; cin >> n;
    vector<bitset<5010>> bit(5010), bit2(5010);
    for (int i = 1; i <= n; i ++) {
        string s; cin >> s;
        bit[i][i - 1] = 1;
        for (int w = 0; w < n; w ++) {
            if (s[w] == '1') bit[i][w] = 1;
        }
    }

    vector<int> ans;
    for (int i = 1; i <= n; i ++) {
        bit2[i] = bit[i];
        for (int w = 0; w < n; w ++) {
            if (bit[i][w]) bit2[i] |= bit[w + 1];
        }
        if (bit2[i].count() == n) ans.push_back(i);
    }
    if (ans.size() < 3) {
        cout << "NOT FOUND" << '\n';
        return;
    }
    cout << ans[0] << ' ' << ans[1] << ' ' << ans[2] << '\n';
}

signed main()
{
    ios;
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    return 0;
}