#include<bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
void solve()
{
    int n;cin>>n;
    vector<int> e[n+1];
    for(int i=1;i<=n;i++)
    {
        string s;cin>>s;
        s=' '+s;
        for(int j=1;j<=n;j++)
            if(s[j]=='1')e[i].push_back(j);
    }
    vector<vector<int>> vis(n+1,vector<int>(3));
    function<void(int,int)> dfs=[&](int u,int dep)
    {
        vis[u][dep]=1;
        if(dep==2) return;
        for(auto v:e[u])
        {
            if(vis[v][1]) continue;
            dfs(v,dep+1);
        }
    };
    vector<int> ans;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++) vis[j][0]=vis[j][1]=vis[j][2]=0;
        vis[i][1]=vis[i][2]=1;
        dfs(i,0);
        int tmp=0;
        for(int j=1;j<=n;j++)
            if(!vis[j][1] && !vis[j][2]) tmp=1;
        if(!tmp) ans.push_back(i); 
    }
    if(ans.size()<3) cout<<"NOT FOUND";
    else for(int i=0;i<3;i++) cout<<ans[i]<<' ';
    cout<<endl;
}
signed main()
{
    cin.tie(0)->sync_with_stdio(0);
    int t=1;
    while(t--) solve();
    return 0;
}