#include<bits/stdc++.h>
#define pb emplace_back
using namespace std;
using ll = long long;

const int N = 7;
int i, j, k, n, m, c[N];
bitset<N> f[N];
vector<int> d, v;

signed main() {
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> n;
	for(i = 1; i <= n; i++) {
		string s; cin >> s;
		bitset<N> u(s);
		f[i] = u;
		d.pb(i), c[i] = f[i].count();
	}
	sort(d.begin(), d.end(), [](int x, int y) {return c[x] > c[y];});
	for(int x : d) {
		int g = 1;
		for(int y : v) {
			if((f[y] & f[x]) == f[x]) {
				g = 0;
				break;
			}
		}
		if(g) v.pb(x);
		if(v.size() == 3) break;
	}
	if(v.size() < 3) cout << "NOT FOUND";
	else cout << v[0] << " " << v[1] << " " << v[2];
	return 0;
}