#include<bits/stdc++.h>
using namespace std;
// #define int long long
typedef pair<int, int> pll;
typedef long long LL;
const int INF = 0x3f3f3f3f3f3f3f3f, mod = 1e9 + 7;

bool multi = 0;
constexpr int N = 5e3 + 7;
vector<int>edge[N];
void solve() {
    int n;
    cin >> n;
    vector<vector<char>>s(n + 1, vector<char>(n + 1));
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            cin >> s[i][j];
            if(s[i][j] == '1')edge[i].push_back(j);
        }
    }
    auto bfs = [&](int x) -> bool {
        queue<pll>q;
        vector<bool>vis(n + 1);
        q.push({x, 0});
        vis[x] = 1;
        int tot = 1;
        while(q.size())
        {
            auto [u, d] = q.front();
            q.pop();
            for (auto v : edge[u])
            {
                if(!vis[v])
                {
                    if(d + 1 > 2)return 0;
                    vis[v] = 1;
                    tot++;
                    q.push({v, d + 1});
                }
            }
        }
        if(tot == n)return 1;
        return 0;
    };
    vector<int>ans;
    for (int i = 1; i <= n; i++)
    {
        if(bfs(i))ans.push_back(i);
    }
    if(ans.size() >= 3)
    {
        for (int i = 0; i < 3; i++)cout << ans[i] << " \n"[i == 2];
    }
    else cout << "NOT FOUND" << endl;
}

signed main() {
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int T = 1;
    if(multi) cin >> T;
    while(T--) {
        solve();
    }

    return 0;
}