#include<bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
ull Bit[5010 + 1][(5010 >> 6) + 1];
ull tBit[5010 + 1][(5010 >> 6) + 1];
void solve() {
	int n;
	cin >> n;
	vector<int> a[n + 1];
	auto F = [&](int s,int t) -> void{
		Bit[s][t >> 6] |= 1ull << (t % 64);	
	};
	auto TF = [&](int s,int t) -> void{
		tBit[s][t >> 6] |= 1ull << (t % 64);	
	};
	auto Q = [&](int s,int t) -> bool{
		for(int i = 0;i <= (n >> 6) + 1;i ++){
			if(Bit[s][i] & tBit[t][i]) return true;
		}
		return false;
	};
	vector<int> mp1(n + 1), mp2(n + 1);
	iota(mp1.begin() + 1, mp1.end(), 1);
	mt19937_64 rd(114514);
	shuffle(mp1.begin() + 1, mp1.end(), rd);
	for(int i = 1; i <= n; i ++){
		mp2[mp1[i]] = i;
	}
	for(int i = 1;i <= n;i ++){
		for(int j = 1;j <= n;j ++){
			char x;
			cin >> x;
			if(i != j){
				if(x == '1'){
					F(i,j);
					TF(j,i);
				} else{
					a[i].push_back(j);
				}
			}
		}
	}
	vector<int> ans;
	for(int i = 1;i <= n;i ++){
		bool ok = true;
		for(auto x : a[i]){
			if(!Q(i,x)){
				ok = false;
				break;
			}
		}
		if(ok){
			ans.push_back(i);
			if(ans.size() == 3) break;
		}
	}
	if(ans.size() == 3){
		for(auto x : ans) cout << x << " ";
	} else {
		cout << "NOT FOUND";
	}
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	solve();
	return 0;
}