#pragma GCC optimize(2)
#pragma GCC optimize(3)

#include<bits/stdc++.h>
using namespace std;
const int N=5001;
bitset<N>baser[N];
bitset<N>basec[N];
int a[N][N];
int b[N][N];
int c[N][N];
int n;
vector<int>ans;
int main()
{
	scanf("%d",&n);
	int st = clock();
	for(int i=1;i<=n;i++)
	{
        getchar();
		for(int j=1;j<=n;j++)
		{
			char ch;
			scanf("%c",&ch);
            a[i][j]=(int)(ch-'0');
			a[i][j]==1?baser[i][j]=1:baser[i][j]=0;
            a[i][j]==1?basec[j][i]=1:basec[j][i]=0;
		}
	}
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=n;j++)
		{
			bitset<N>T=baser[i]&basec[j];
            if(T.any())b[i][j]=1;
            else b[i][j]=0;
            //printf("%d",b[i][j]);
			int ed = clock();
			if (ed - st > 950) {
				break;
			}
		}
        //printf("\n");
	}
	for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            if(a[i][j]==0&&b[i][j]==0)c[i][j]=0;
            else c[i][j]=1;
        }
    }
    for(int i=1;i<=n;i++)
    {
        int flag=1;
        for(int j=1;j<=n;j++)
        {
            if(j==i)continue;
            else
            {
                if(c[i][j]==0)flag=0;
            }
        }
        if(flag)ans.push_back(i);
    }
    if(ans.size()<3)printf("NOT FOUND\n");
    else
    {
        for(int i=0;i<=2;i++)
        {
            printf("%d ",ans[i]);
        }
        printf("\n");
    }
	return 0;
}