#include <bits/stdc++.h>
using namespace std;
int n;
vector <int> ans; 
char s[5010];
bitset <5001> f[5001], tmp;
int main(){
	scanf ("%d", &n);
	for (int i=1; i<=n; i++){
		scanf ("%s", s+1);
		for (int j=1; j<=n; j++){
			if (s[j] == '1') f[i][j] = 1;
		}
		f[i][i] = 1;
	}
	for (int i=1; i<=n; i++){
		tmp = f[i];
		for (int j=1; j<=n; j++){
			if (f[i][j]){
				if (tmp.count() == n) break;
				tmp |= f[j];
			}
		}
		if (tmp.count() == n){
			ans.push_back(i);
			if (ans.size() == 3) break;
		}
	}
	if (ans.size() < 3) return puts ("NOT FOUND"), 0;
	for (int i=0; i<ans.size(); i++){
		printf ("%d ", ans[i]);
	}
	puts ("");
	return 0;
}