#pragma GCC optimize(2)
#pragma GCC optimize(3)

#include <bits/stdc++.h>

using namespace std;

using i64 = long long;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int n;
	cin >> n;
	
	string g[n];
	for (int i = 0; i < n; i++) {
		cin >> g[i];
	}
	
	vector<vector<int>> adj(n);
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if (g[i][j] == '1') {
				adj[i].push_back(j);
			}
		}
	}
	
	auto bfs = [&](int u) -> bool {
		vector<vector<int>> vis(n, vector<int>(3));
		queue<pair<int, int>> q;
		q.push({u, 0});
		while (!q.empty()) {
			auto [x, step] = q.front();
			q.pop();
			
			if (vis[x][step]) {
				continue;
			}
			vis[x][step] = 1;
			if (step >= 3) {
				break;
			}
			
			for (auto y : adj[x]) {
				if (!vis[y][step + 1]) {
					q.push({y, step + 1});
				}
			}
			if (q.size() >= 40*n) {
				break;
			}
		}
		
		// cerr << "f" << "\n";
		// cerr << u << "\n";
		// for (int i = 0; i < n; i++) {
		// 	cerr << vis[i][0] << " " << vis[i][1] << "\n";
		// }
		int cnt = 0;
		for (int i = 0; i < n; i++) {
			if (vis[i][0] || vis[i][1] || vis[i][2]) {
				cnt++;
			}
		}
		
		return cnt >= n;
	};
	
	vector<int> ans;
	for (int i = 0; i < n; i++) {
		if (bfs(i)) {
			ans.push_back(i + 1);
		}
		if (ans.size() >= 3) {
			break;
		}
	}
	
	if (ans.size() >= 3) {
		cout << ans[0] << " " << ans[1] << " " << ans[2] << "\n";
	} else {
		cout << "NOT FOUND" << "\n";
	}
	
	return 0;
}