#include<bits/stdc++.h>
using namespace std;
const int N=5005;
using vi=vector<int>;
int n;char s[N];
int lk[N][N];
int dg[N],id[N];
bool cmp(int x,int y)
{return dg[x]>dg[y];}
int main()
{
    cin>>n;vi rs(3);
    for(int i=1;i<=n;i++)
    {
        cin>>s+1;
        for(int j=1;j<=n;j++)
        lk[i][j]=s[j]-'0';
    }iota(id+1,id+n+1,1);
    for(int i=1;i<=n;i++)
    for(int j=1;j<=n;j++)
    dg[i]+=lk[i][j];
    sort(id+1,id+n+1,cmp);
    if(dg[id[1]]==n-1)return cout<<"NOT FOUND\n",0;
    rs[0]=id[1];vi S;int m=0;
    for(int i=1;i<=n;i++)
    if(lk[i][id[1]])S.push_back(i);
    for(auto u:S)
    {
        dg[u]=0;id[++m]=u;
        for(auto v:S)
        dg[u]+=lk[u][v];
    }sort(id+1,id+m+1,cmp);
    if(dg[id[1]]==n-1)return cout<<"NOT FOUND\n",0;
    rs[1]=id[1];m=0;S.clear();
    for(int i=1;i<=n;i++)
    if(lk[i][id[1]])S.push_back(i);
    for(auto u:S)
    {
        dg[u]=0;id[++m]=u;
        for(auto v:S)
        dg[u]+=lk[u][v];
    }sort(id+1,id+m+1,cmp);
    cout<<rs[0]<<' '<<rs[1]<<' '<<id[1]<<'\n';
    return 0;
}