#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PII;

void solve()
{
    int n;
    cin >> n;
    vector<string> mp(n);
    vector<bitset<5000>> dp(n), f(n);
    for (int i = 0; i < n; i ++ )
    {
        cin >> mp[i];
        for (int j = 0; j < n; j ++ )
        {
            dp[i][j] = (mp[i][j] == '1');
            f[i][j] = (mp[i][j] == '1');
        }
        dp[i][i] = f[i][i] = 1;
    }
        
    for (int k = 0; k < n; k ++ )
        for (int i = 0; i < n; i ++ )
            if (dp[i][k])
                f[i] |= dp[k];
    // puts("");
    // for (int i = 0; i < n; i ++ ) cout << dp[i] << '\n';
    // cout << "\n";
    // for (int i = 0; i < n; i ++ ) cout << f[i] << '\n';
    vector<int> ans;
    for (int i = 0; i < n; i ++ )
        if (f[i].count() == n)
            ans.push_back(i + 1);
    if (ans.size() < 3) cout << "NOT FOUND\n";
    else cout << ans[0] << ' ' << ans[1] << ' ' << ans[2] << '\n';
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int T = 1;
    // cin >> T;
    while (T -- ) solve();
    return 0;
}