#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace std; using namespace __gnu_pbds; using namespace __gnu_cxx;
#define For(i,x,y,...) for(int i=x,##__VA_ARGS__;i<=(y);++i)
#define rFor(i,x,y,...) for(int i=x,##__VA_ARGS__;i>=(y);--i)
#define Rep(i,x,y,...) for(int i=x,##__VA_ARGS__;i<(y);++i)
#define pb emplace_back
#define sz(a) int((a).size())
#define all(a) (a).begin(),(a).end()
#define fi first
#define se second
#define mkp make_pair
#define mem(a,x,n) memset(a,x,sizeof(a[0])*(n+2))
typedef long long LL; typedef vector<int> Vi; typedef pair<int,int> Pii;
auto ckmax=[](auto &x,auto y) { return x<y ? x=y,true : false; };
auto ckmin=[](auto &x,auto y) { return y<x ? x=y,true : false; };
sfmt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l,int r) { return uniform_int_distribution<>(l,r)(mt); }
template<typename T=int>T read() { T x; cin>>x; return x; }

const int mod = 998244353;
struct mint {
	int x; mint(int x=0):x(x<0?x+mod:x<mod?x:x-mod){}
	mint(LL y) { y%=mod, x=y<0?y+mod:y; }
	mint& operator += (const mint &y) { x=x+y.x<mod?x+y.x:x+y.x-mod; return *this; }
	mint& operator -= (const mint &y) { x=x<y.x?x-y.x+mod:x-y.x; return *this; }
	mint& operator *= (const mint &y) { x=1ll*x*y.x%mod; return *this; }
	friend mint operator + (mint x,const mint &y) { return x+=y; }
	friend mint operator - (mint x,const mint &y) { return x-=y; }
	friend mint operator * (mint x,const mint &y) { return x*=y; }
};	mint Pow(mint x,LL y=mod-2) { mint z(1);for(;y;y>>=1,x*=x)if(y&1)z*=x;return z; }

const int N = 5e3+5;
int n,nn,dfn[N],low[N],id[N];
Vi ans,e[N],scc[N];
bitset<N> s[N];

void tj(int u) {
	static int s[N],t;
	dfn[u] = low[u] = ++dfn[0], s[++t] = u, id[u] = -1;
	for(int v : e[u])
		if( !dfn[v] ) tj(v), ckmin(low[u],low[v]);
		else if( !~id[v] ) ckmin(low[u],dfn[v]);
	if( dfn[u] == low[u] ) {
		++nn;
		do id[s[t]] = nn, scc[nn].pb(s[t]); while( u != s[t--] );
	}
}

void MAIN() {
	// n = 5e3;
	// For(i,1,n) For(j,i+1,n) (rnd(0,1) ? s[i][j] : s[j][i]) = 1;
	// For(i,1,n) s[i%n+1][i] = 0, s[i][i%n+1] = 1;
	// For(i,1,n) For(j,1,n) if( s[i][j] ) e[i].pb(j);
	cin>>n; For(i,1,n) For(j,1,n) if( read<char>() == '1' ) e[i].pb(j), s[i][j] = 1;
	For(i,1,n) if( !dfn[i] ) tj(i);
	if( nn > 3 ) { cout<<"NOT FOUND\n"; return; }
	sort(all(scc[nn]),[](int x,int y){return sz(e[x])>sz(e[y]);});
	for(int u : scc[nn]) {
		if( clock() > 990000 ) break;
		bitset<N> vis = s[u]; vis[u] = 1;
		for(int v : e[u]) if( id[v] == nn ) {
			if( sz(e[v]) < 70 ) for(int w : e[v]) vis[w] = 1;
			else vis |= s[v];
		}
		if( vis.count() == n ) {
			ans.pb(u);
			if( sz(ans) == 3 ) break;
		}
	}
	if( sz(ans) < 3 ) { cout<<"NOT FOUND\n"; return; }
	cout<<ans[0]<<" "<<ans[1]<<" "<<ans[2]<<'\n';
} signed main() {
#ifdef FS
	freopen("in","r",stdin); freopen("out","w",stdout);
#endif
	ios::sync_with_stdio(0);cin.tie(0);
	int lft=1; while( lft-- ) {
		MAIN();
	}
	return 0;
}