#include <bits/stdc++.h>
#define int long long 
#define endl '\n'
using namespace std;
void solve() {
	int n;
	cin >> n;
	bitset<5009>z[5009];
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			char x;
			cin >> x;
			x -= '0';
			z[i][j] = x;
		}
	}
	int res[10];
	int cnt = 0;
	for (int i = 1; i <= n; i++) {
		bitset<5009>tmp = z[i];
		bitset<5009>ans = z[i];

		for (int j = 1; j <= n; j++) {
			if (tmp[j]) {
				ans |= z[j];
			}
		}
		if (ans.count() == n - 1) {
			res[++cnt] = i;
			if (cnt == 3)
				break;
		}
	}
	if (cnt == 3) {
		for (int i = 1; i <= 3; i++) {
			cout << res[i] << ' ';
		}
		cout << endl;
	}
	else {
		cout << "NOT FOUND" << endl;
	}
}
signed main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
	int t = 1;
	//cin >> t;
	while (t--) {
		solve();
	}
	return 0;
}