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

using ui = unsigned;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define rep(i,l,r) for(int i=(l);i<=(r);++i)
#define per(i,l,r) for(int i=(l);i>=(r);--i)
#define repn(i,n)  for(int i=0;i<(n);++i)
#define sizc(x) ((int)x.size())
#define allc(x) x.begin(),x.end()
#define fir first
#define sec second

constexpr int N = 5005;

int n;

bitset<N> e[N];

int vis[N];
vector<int> vt;

void dfs1(int i){
    vis[i]=1;
    rep(j,1,n)if(e[i][j]&&!vis[j])dfs1(j);
}
void dfs2(int i){
    vt.push_back(i);
    vis[i]=1;
    rep(j,1,n)if(e[j][i]&&!vis[j])dfs2(j);
}

signed main(){
    // freopen(".in","r",stdin);
    // freopen(".out","w",stdout);
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    cin>>n;
    rep(i,1,n)rep(j,1,n){
        char ch;cin>>ch;
        e[i][j]=ch-'0';
    }
    int lst;
    rep(i,1,n)if(!vis[i])dfs1(lst=i);
    rep(i,1,n)vis[i]=0;dfs2(lst);
    sort(allc(vt),[&](int x,int y){return e[x].count()>e[y].count();});
    vector<int> ans;
    for(auto i:vt){
        auto s=e[i];s[i]=1;
        rep(j,1,n)if(e[i][j])s|=e[j];
        if(s.count()==n)ans.push_back(i);
        if(ans.size()==3)break;
    }
    if(ans.size()<3)cout<<"NOT FOUND";
    else for(auto i:ans)cout<<i<<' ';cout<<'\n';
}