#include<bits/stdc++.h>
#define pb push_back
#define P make_pair
#define fi first
#define se second
#define bit(s,x) (((s)>>(x))&1)
#define pnp(s) __builtin_popcountll(s)
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
typedef long long ll; 
typedef unsigned long long ull;
typedef pair<int,int> pii;
inline ll read(){
	ll x=0,f=1,c=getchar();
	while(c<'0'||c>'9')f=(c=='-'?-1:1),c=getchar();
	while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return x*f;
}
const int N=5003;
int n,a[N],id[N];
bitset<N>bs[N];
int main() {
    //freopen("data.in", "r", stdin);
    // freopen("myans.out","w",stdout);
	n=read();
	rep(i,1,n){
		static char s[N]; scanf("%s",s+1);
		rep(j,1,n)bs[i][j]=s[j]&1;
		a[i]=bs[i].count();
		id[i]=i;
	}
	sort(id+1,id+n+1,[&](int i,int j){return a[i]>a[j];});
	int b[3]={id[1],0,0},m=0;
	rep(I,2,n){
		int i=id[I];
		bool fl=1;
		rep(j,0,m)if((bs[i]&bs[b[j]])==bs[i]){fl=0;break;}
		if(fl){
			b[++m]=i;
			if(m==2)break;
		}
	}
	if(m<2)puts("NOT FOUND");
	else rep(i,0,2)printf("%d ",b[i]);
    return 0;
}