#include<bits/stdc++.h>
using namespace std;
const int N=5005;
int n,a,b,c,d[N];char g[N][N];
void find1(){
	for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)d[i]+=g[i][j]=='1';
	for(int i=1;i<=n;i++)if(d[i]>d[a])a=i;
}
vector<int> s;
void find2(){
	for(int i=1;i<=n;i++)if(g[i][a]=='1')s.push_back(i),d[i]=0;
	for(auto x:s)for(auto y:s)d[x]+=g[x][y]=='1';
	for(auto x:s)if(d[x]>d[b]||!b)b=x;
	if(!s.size())printf("NOT FOUND\n"),exit(0);
}
void find3(){s.clear();
	for(int i=1;i<=n;i++)if(g[a][i]=='1'&&g[i][b]=='1')s.push_back(i),d[i]=0;
	for(auto x:s)for(auto y:s)d[x]+=g[x][y]=='1';
	for(auto x:s)if(d[x]>d[c]||!c)c=x;
}
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++)scanf("%s",g[i]+1);
	find1(),find2(),find3();
	printf("%d %d %d",a,b,c);
	return 0;
}