#include<iostream>
#include<vector>
#include<cstring>

using namespace std;

const int N=5e3+10;

bool m[N][N];
int a,b,c;
int s[N];

int main()
{
	int n;
	cin>>n;
	
	int a,maxa=0;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=n;j++)
		{
			char ch;
			cin>>ch;
			
			m[i][j] = (ch == '1');
			s[i] += (ch == '1');
		}
		if(maxa < s[i])
		{
			maxa = s[i];
			a = i;
		}
	}
	
	if(maxa == n - 1)
	{
		cout<<"NOT FOUND"<<endl;
		return 0;
	}
	
	vector<int> v;
	for(int i=1;i<=n;i++)
		if(m[i][a])
			v.push_back(i);
	
	int maxb=-1, b;
	memset(s,0,sizeof s);		
	for(auto x : v)
	{
		for(auto y : v)
		{
			if(m[x][y])
				s[x] ++;
		}
		if(s[x]>maxb)
		{
			maxb = s[x];
			b=x;
		}
	}
	
	int c;
	if(maxb != v.size() - 1)
	{
		vector<int> w;
		for(auto x : v)
			if(m[x][b])
				w.push_back(x);
		
		int maxc = -1;
		memset(s,0,sizeof s);
		for(auto x : w)
		{
			for(auto y : w)
				if(m[x][y])
					s[x]++;
			
			if(maxc < s[x])
			{
				c = x;
				maxc = s[x];
			}
		}
	}
	else
	{
		vector<int> w;
		for(int j=1;j<=n;j++)
			if(m[a][j] && m[j][b])
				w.push_back(j);
				
		int maxc = -1;
		memset(s,0,sizeof s);
		for(auto x : w)
		{
			for(auto y : w)
				if(m[x][y])
					s[x]++;
			
			if(maxc < s[x])
			{
				c = x;
				maxc = s[x];
			}
		}
	}
	
	cout<<a<<' '<<b<<' '<<c<<endl;
	
	return 0;
}