// #pragma GCC optimize("Ofast,no-stack-protector")
#include <bits/stdc++.h>

using namespace std;

const int N = 5000;
const int inf = 1 << 30;
const long long llinf = 1ll << 60;
const double PI = acos(-1);

#define lowbit(x) (x & -x)
typedef long long ll;
typedef double db;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<db, db> pdd;
typedef pair<ll, int> pli;

int n, m, k, q;

bitset<N> a[N];
void work()
{
	int n;
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		string s;
		cin >> s;
		reverse(s.begin(), s.end());
		a[i] = bitset<N>(s);
	}
	vector<int> v;
	for (int i = 0; i < n; i++)
	{
		auto s = a[i];
		int pos = a[i]._Find_first();
		bool flag = true;
		while (pos < n)
		{
			if (pos == i)
			{
				pos = a[i]._Find_next(pos);
				continue;
			}
			s |= a[pos];
			pos = a[i]._Find_next(pos);
		}
		if (s.count() >= n - 1)
		{
			v.push_back(i);
			if (v.size() >= 3)
				break;
		}
	}
	if (v.size() < 3)
		cout << "NOT FOUND\n";
	else
	{
		for (auto x : v)
			cout << x + 1 << ' ';
		cout << '\n';
	}
}
int main()
{
	ios::sync_with_stdio(0);
	cin.tie();
	work();
}