#include<bits/stdc++.h>
using namespace std;
#define N 5005
//#define pii pair<int,int>
//#define fi first
//#define se second
//#define rep(i,j,k) for(int i=j;i<=k;i++)
int n;
char s[N][N];
int vis[N],f[N],g[N],rnk[N];
vector<int>ans;
void chk(int x){
	memset(f,-1,sizeof(f));
	queue<int>q;
	q.push(x);
	f[x]=0;
	while(q.size()){
		int u=q.front();q.pop();
		for(int i=1;i<=n;i++)if(!(~f[i])&&s[u][i]-'0')f[i]=f[u]+1,q.push(i);
	}
	// for(int i=1;i<=n;i++)cout<<f[i]<<' ';cout<<endl;
	int mx=0,p;
	for(int i=1;i<=n;i++){
		if(f[i]==-1)f[i]=114514;
		if(f[i]>mx)mx=f[i],p=i;
		if(ans.size()==3)return;
	}
	if(mx<=2)ans.push_back(x),vis[x]=1;
	else if(!vis[p])ans.push_back(p),vis[p]=1;
	if(mx==1){
		cout<<"NOT FOUND";exit(0);
	}
}
signed main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++)cin>>(s[i]+1),rnk[i]=i;
	// chk(2);
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)g[i]+=s[i][j]-'0';
	sort(rnk+1,rnk+1+n,[](int x,int y){return g[x]>g[y];});
	for(int j=1;j<=n;j++){
		int i=rnk[j];
		if(vis[i])continue;
		chk(i);
		if(ans.size()==3)break;
	}
	if(ans.size()!=3){cout<<"NOT FOUND";return 0;}
	for(int v:ans)cout<<v<<' ';
	return 0;
}