#include <bits/stdc++.h>
#define fi first
#define se second
#define pb emplace_back
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int N = 5007;
int i, j, k, l, r, m, n, idx, p[N], c[N];
char str[N]; bitset <N> d[N];
signed main()
{
//	freopen(".in", "r", stdin);
//	freopen(".out", "w", stdout);
//	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	scanf("%d", &n);
	for (i=1; i<=n; i++) 
	{
		scanf("%s", str+1);
		for (j=1; j<=n; j++) c[i] += d[i][j] = str[j] == '1';
	}
	iota(p+1, p+n+1, 1);
	sort(p+1, p+n+1, [](int i, int j){return c[i] > c[j];});
	vector <int> ans;
	for (i=1; i<=n; i++)
	{
		int flag = 1;
		for (int j:ans) flag &= (d[p[i]] & d[j]) != d[p[i]];
		if (flag) ans.pb(p[i]);
		if (ans.size() >= 3) break;
	}
	if (ans.size() < 3) puts("NOT FOUND");
	else printf("%d %d %d", ans[0], ans[1], ans[2]);
	return 0;
}