#include <bits/stdc++.h>
using namespace std;
int n, d[5005];
const int N = 10;
char s[5005];
bitset<N> a[5000];
bitset<N> pre[5000];
vector<pair<int, int> > v;
vector<int> ans;
int main() {
	scanf("%d", &n);
	for (int i = 0; i < n; ++i) {
		scanf("%s", s);
		for (int j = 0; j < n; ++j) {
			a[i][j] = s[j] - '0';
			if (s[j] == '1') {
				++d[j];
				pre[j][i] = 1;
			}
		}
	}
	for (int i = 0; i < n; ++i)
		v.push_back({d[i], i});
	sort(v.begin(), v.end());
	bitset<N> ret;
	ret.set();
	for (int i = 0; i < 50 && i < v.size(); ++i) {
		if (pre[v[i].second].none()) {}
		else {
			auto tmp = pre[pre[v[i].second]._Find_first()] | pre[v[i].second];
			tmp[v[i].second] = 1;
			ret &= tmp;
		}
	}
	for (int i = 0; i < n; ++i)
		if (ret[i]) {
			bitset<N> test = a[i];
			test[i] = 1;
			for (int x = 0; x < n; ++x)
				if (a[i][x])
					test |= a[x];
			if (test.count() == n) {
				ans.push_back(i);
				if (ans.size() == 3) break;
			}
		}
	if (ans.size() < 3) puts("NOT FOUND");
	else printf("%d %d %d\n", ans[0] + 1, ans[1] + 1, ans[2] + 1);
	return 0;
}