#include <bits/stdc++.h>
using namespace std;

const int N = 5005;

int n, deg[N];
bool e[N][N];
vector<int> ans;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin >> n;
	for (int i = 1; i <= n; i++) {
		string str;
		cin >> str;
		for (int j = 1; j <= n; j++) {
			e[i][j] = str[j - 1] - '0';
			deg[i] += e[i][j];
		}
	}
	int u = 1;
	for (int i = 1; i <= n; i++) {
		if (deg[u] < deg[i]) {
			u = i;
		}
	}
	ans.emplace_back(u);
	for (int t = 1; t <= 2; t++) {
		int v = -1;
		for (int i = 1; i <= n; i++) {
			if (e[i][u] == 1 && (v == -1 || deg[v] < deg[i])) {
				v = i;
			}
		}
		if (v == -1) {
			cout << "NOT FOUND\n";
			return 0;
		}
		deg[u] = 0;
		for (int i = 1; i <= n; i++) {
			deg[i] -= e[i][u];
			e[u][i] = e[i][u] = 0;
		}
		u = v;
		ans.emplace_back(u);
	}
	cout << ans[0] << ' ' << ans[1] << ' ' << ans[2] << '\n';

	return 0;
}