#include<bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
#define w 2
#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];
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=1;
	for(int i=1;i<=n;i++){
		if(f[i]==-1)f[i]=114514;
		if(f[i]>2){mx=0;if(!vis[i])ans.push_back(i),vis[i]=1;}
		if(ans.size()==3)return;
	}
	if(mx)ans.push_back(x),vis[x]=1;
}
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);
	// chk(2);
	for(int i=1;i<=n;i++){
		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;
}