#include<bits/stdc++.h> 
using namespace std;
const int N=5005,test=0;
char s[N][N];
bool fl[N],fl2[N];
int dg1[N],dg2[N],dg3[N];
void Solve(){
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
        scanf("%s",s[i]+1);
    int maxn=-1,x1=-1;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++)
            if(s[i][j]=='1')++dg1[i];
        if(dg1[i]>=maxn)maxn=dg1[i],x1=i;
    }
    if(dg1[x1]==n-1){
        cout<<"NOT FOUND"<<endl;
        return;
    }
    maxn=-1;
    int x2=-1,m=0;
    for(int i=1;i<=n;i++)
        if(x1!=i&&s[x1][i]=='0')fl[i]=1;
    for(int i=1;i<=n;i++){
        if(!fl[i])continue;
        ++m;
        for(int j=1;j<=n;j++)
            if(fl[j]&&s[i][j]=='1')++dg2[i];
        if(test)cout<<i<<" "<<dg2[i]<<endl;
        if(dg2[i]>=maxn)maxn=dg2[i],x2=i;
    }
    int x3=-1;
    if(dg2[x2]==m-1){
        for(int i=1;i<=n;i++){
            if(x1==i||fl[i]||s[x2][i]=='1')continue;
            fl2[i]=1;
        }
    }
    else {
        for(int i=1;i<=n;i++){
            if(x2==i||!fl[i]||s[x2][i]=='1')continue;
            fl2[i]=1;
        }
    }
    maxn=-1;
    for(int i=1;i<=n;i++){
        if(!fl2[i])continue;
        for(int j=1;j<=n;j++)
            if(fl2[j]&&s[i][j]=='1')++dg3[i];
        if(dg3[i]>=maxn)maxn=dg3[i],x3=i;
    }
    cout<<x1<<" "<<x2<<" "<<x3<<"\n";
}
int main(){
    Solve();
    return 0;
}