#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
#define I inline
using namespace std;

const int N = 5010;
struct node {
	int out,id;
}a[N];
char s[N][N];
int n;
vector<int> dom;

I bool cmp(node n1,node n2) {
	return n1.out>n2.out;
}
int main()
{
	cin>>n;
	for(int i=1;i<=n;++i) scanf("%s",(s[i]+1));
	for(int i=1;i<=n;++i) {
		a[i].id=i;
		for(int j=1;j<=n;++j) {	
			if(s[i][j]=='1') a[i].out++;
		}
	}
	sort(a+1,a+1+n,cmp);
	dom.push_back(a[1].id);
	for(int i=2;i<=n;++i) {
		bool cov=0;
		for(auto &t:dom) {
			bool f=1;
			for(int j=1;j<=n;++j) if(s[i][j]>s[t][j]) f=0; 
			if(f) cov=1;
		}
		if(!cov) dom.push_back(a[i].id);
		if(dom.size()==3) {
			break;
		}
	}
	if(dom.size()==3) for(auto &t:dom) cout<<t<<' ';
	else cout<<"NOT FOUND"<<endl;
}