#include <bits/stdc++.h>
using namespace std;
const int maxn = 5005;
int n, e[maxn][maxn], vis[maxn], cnt, need;
void work(int u) {
	for(int v = 1; v <= n; v++) {
		if(!e[u][v]) {
			continue;
		}
		if(!vis[v]) {
			vis[v] = 1;
			cnt++;
		}
	}
	for(int v = 1; v <= n; v++) {
		if(!e[u][v]) {
			continue;
		}
		for(int w = 1; w <= n; w++) {
			if(e[v][w] && !vis[w]) {
				vis[w] = 2;
				cnt++;
			}
		}
	}
}
void clear() {
	for(int i = 1; i <= n; i++) {
		vis[i] = 0;
	}
}
int find(int u) {
	work(u);
//	cout << cnt << '\n';
	if(cnt == need) {
		return u;
	}
	
	for(int i = 1; i <= n; i++) {
//		if(u == 6) {
//			cout << i << ' ' << vis[i] << '\n';
//		}
		if(!vis[i] && i != u) {
			return find(i);
		}
	}
	return -1;
}
int main(){
	
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n;
	for(int i = 1; i <= n; i++) {
		string s;
		cin >> s;
		int c = 0;
		for(int j = 1; j <= n; j++) {
			e[i][j] = s[j - 1] - '0';
			c += e[i][j];
		}
	}
	clear();
	need = n - 1;
	cnt = 0;
	int x = find(1);
	if(x == -1) {
		cout << "NOT FOUND\n";
		return 0;
	}
	clear();
	work(x);
	int p = 0;
	need = 0;
	for(int i = 1; i <= n; i++) {
		if(vis[i] == 2) {
			p = i;
			vis[i] = 0;
			need++;
		}
	}
	vis[x] = 1;
	need--;
	if(!p) {
		cout << "NOT FOUND\n";
		return 0;
	}
//	cout << x << ' ';
//	cout << p << ' ';
//	cout << need << '\n';
//	for(int i = 1; i <= n; i++) {
//		cout << vis[i] << ' ';
//	}
//	cout << '\n';
	cnt = 0;
	int y = find(p);
//	cout << y << '\n';
	if(y == -1) {
		cout << "NOT FOUND\n";
		return 0;
	}
	clear();
	work(y);
	p = need = 0;
	for(int i = 1; i <= n; i++) {
		if(vis[i] == 2) {
			p = i;
			vis[i] = 0;
			need++;
		}
	}
	need--;
	vis[y] = 1;
	if(!p) {
		cout << "NOT FOUND\n";
		return 0;
	}
	cnt = 0;
	int z = find(p);
	if(z == -1) {
		cout << "NOT FOUND\n";
		return 0;
	}
	cout << x << ' ' << y << ' ' << z << '\n';
	return 0;
}