#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define u1 (u<<1)
#define u2 (u<<1|1)
#define pb push_back
#define pp pop_back()
#define int long long
#define laile cout<<"laile"<<endl
#define lowbit(x) ((x)&(-x))
#define double long double
#define sf(x) scanf("%lld",&x)
#define sff(x,y) scanf("%lld %lld",&x,&y)
#define sd(x) scanf("%Lf",&x)
#define sdd(x,y) scanf("%Lf %Lf",&x,&y)
#define _for(i,n) for(int i=0;i<(n);++i)
#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 all(x) (x).begin(), (x).end()
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
typedef unsigned long long ULL;
typedef pair<int,int>PII;
const int N=5050,INF=4e18;
int n,m;
char g[N][N];
char g2[N][N];
string hang[N],lie[N];
void solve()
{
	cin>>n;
	m=n;
	_rep(i,1,n)
	{
		string now="";
		_rep(j,1,m)
			cin>>g[i][j],now.pb(g[i][j]);
		hang[i]=now;
	}
	_rep(j,1,m)
	{
		string now="";
		_rep(i,1,n)
			now.pb(g[i][j]);
		lie[j]=now;
	}
	vector<int>res;
	for(int i=n/2;i<=n;i++)
	{
		bool bl=true;
		bitset<N>b1(hang[i]);
		int x=rand()%(n/10+1);
		x++;
		for(int k=1;k<=x;k++)
		{
			if(k&1)
			{
				for(int j=n/x*x+k%x;j>=1;j-=x)
				{
					if(i==j)continue;
					bitset<N>b2(lie[j]);
					if((b1&b2).any());
					else if(g[i][j]=='0')
					{
						bl=false;
						break;
					}
				}
			}
			else 
			{
				for(int j=k;j<=n;j+=x)
				{
					if(i==j)continue;
					bitset<N>b2(lie[j]);
					if((b1&b2).any());
					else if(g[i][j]=='0')
					{
						bl=false;
						break;
					}
				}
			}
			if(!bl)break;
		}
		if(bl)res.pb(i);
		if(res.size()>=3)break;
	}
	for(int i=n/2-1;i>=1;i--)
	{
		if(res.size()>=3)break;
		bool bl=true;
		bitset<N>b1(hang[i]);
		int x=rand()%(n/5+1);
		x++;
		for(int k=1;k<=x;k++)
		{
			if(k&1)
			{
				for(int j=n/x*x+k%x;j>=1;j-=x)
				{
					if(i==j)continue;
					bitset<N>b2(lie[j]);
					if((b1&b2).any());
					else if(g[i][j]=='0')
					{
						bl=false;
						break;
					}
				}
			}
			else 
			{
				for(int j=k;j<=n;j+=x)
				{
					if(i==j)continue;
					bitset<N>b2(lie[j]);
					if((b1&b2).any());
					else if(g[i][j]=='0')
					{
						bl=false;
						break;
					}
				}
			}
			if(!bl)break;
		}
		if(bl)res.pb(i);
		if(res.size()>=3)break;
	}
	if(res.size()<3)cout<<"NOT FOUND\n";
	else cout<<res[0]<<" "<<res[1]<<" "<<res[2]<<'\n';
	return ;
}
signed main()
{
	IOS;
	int T=1;
//	cin>>T;
	while(T--)
		solve();
	return 0;
}