#include<iostream>
#include<vector>

using namespace std;

const int N = 5005;

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

int main()
{
	int n;
	cin>>n;
	
	int maxa=0,maxi;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=n;j++)
		{
			char ch;
			cin>>ch;
			
			if(ch == '0') a[i][j]=0;
			else
			{
				a[i][j]=1;
				s[i] ++;
				t[j] ++;
			}
		}
		
		if(maxa<s[i]) maxa=s[i], maxi=i;
	}
	
	if(maxa == n - 1)
	{
		cout << "NOT FOUND" << endl;
		return 0;
	}
	
	vector<int>v;
	for(int i=1;i<=n;i++)
		if(a[i][maxi])
			v.push_back(i);
			
	if(v.size()>1)
	{
		cout<<maxi<<' '<<v[0]<<' '<<v[1]<<endl;
		
		return 0;
	}
	
	b=v[0];
	if(s[b] == t[maxi]-1)
	{
		cout << "NOT FOUND" << endl;
		return 0;
	}
	
	for(int i=1;i<=n;i++)
		if(a[i][b])
			c=i;
			
	cout<<maxi<<' '<<b<<' '<<c<<endl;
	
	return 0;
}