#include<bits/stdc++.h>
#define lowbit(x) (x & (-x))
#define endl "\n"
#define ll long long
// #define int long long
using namespace std;
#define pii pair<int, int>
#define rep(i, a, b) for(int i = a; i <= b; i ++ )
#define pre(i, a, b) for(int i = a; i >= b; i -- )
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
mt19937_64 rnd(time(0));
const int N = 1e6 + 10;
int n, m, k;
string s[5050];
int a[10], b[10];
bitset<5050>dis[5050][2];
void solve()
{
    cin >> n;
    rep(i, 1, n)
    {
        cin >> s[i];
        s[i] = " " + s[i];
        dis[i][0][i] = 1;
        rep(j, 1, n)
        {
            if(s[i][j] == '1')
            {
                dis[i][0][j] = 1;
            }
        }
        dis[i][1] = dis[i][0];
    }
    rep(i, 1, n)
    {
        rep(j, 1, n)
        {
            if(s[i][j] == '1') dis[i][1] |= dis[j][0];
        }
    }
    vector<int>ans;
    rep(i, 1, n)
    {
        if(dis[i][1].count() == n) ans.push_back(i);
    }
    if(ans.size() < 3)
    {
        cout << "NOT FOUND" << endl;
    }
    else
    {
        rep(i, 0, 2) cout << ans[i] << " ";
    }
}
signed main()
{
    IOS;
    int _;
    _ = 1;
    // cin >> _;
    while(_ -- )
    {
        solve();
    }
	return 0;
}