#include<bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
void solve()
{
    int n;cin>>n;
    string s[n+1];
    for(int i=1;i<=n;i++)
    {
        cin>>s[i];
        s[i]=' '+s[i];
    }
    vector<int> deg(n+1);
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            if(s[i][j]=='1') deg[i]++;
    int A=1,B=-1,C=-1;
    for(int i=2;i<=n;i++)
        if(deg[i]>deg[A]) A=i;
    if(deg[A]==n-1) return cout<<"NOT FOUND",void();
    vector<int> vis(n+1),key(n+1);
    for(int i=1;i<=n;i++)
        if(s[i][A]=='1') vis[i]=1,B=i;
    if(B==-1) return cout<<"NOT FOUND",void();
    fill(deg.begin(),deg.end(),0);
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            if(vis[i] && vis[j] && s[i][j]=='1') deg[i]++;
    for(int i=1;i<=n;i++) if(vis[i] && deg[i]>deg[B]) B=i;
    for(int i=1;i<=n;i++) if(s[i][B]=='1') key[i]=1,C=i;
    fill(deg.begin(),deg.end(),0);
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            if(key[i] && key[j] && s[i][j]=='1') deg[i]++;
    for(int i=1;i<=n;i++) if(key[i] && deg[i]>deg[C]) C=i;
    if(C==-1) return cout<<"NOT FOUND",void();
    cout<<A<<' '<<B<<' '<<C;
}
signed main()
{
    cin.tie(0)->sync_with_stdio(0);
    int t=1;
    while(t--) solve();
    return 0;   
}