#include<bits/stdc++.h>
#define int long long
using namespace std;
using ll =long long;
const int N=5000+6;

char a[N][N];
int b[N][N];

void solve()
{
    int n;cin>>n;
    vector<vector<int>> g(n+1);
    vector<vector<int>> h(n+1);
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            cin>>a[i][j];
            if(a[i][j]=='1'){
                g[i].push_back(j);
            }
        }
    }


    for(int i=1;i<=n;i++){
        for(auto it : g[i]){
            for(auto jt : g[it]){
                h[i].push_back(jt);
                b[i][jt]=it;
            }
        }
    }

    vector<int> ans;

    for(int i=1;i<=n;i++){
        int cnt=0;
        for(int j=1;j<=n;j++){
            if(i==j||a[i][j]=='1'){
                cnt++;
                continue;
            }
            if(b[i][j]>0){
                cnt++;
            }
        }
        if(cnt==n){
            ans.push_back(i);
        }
        if(ans.size()==3){
            for(auto it : ans){
                cout<<it<<" ";
            }
            cout<<"\n";
            return ;
        }
    }
    cout<<"NOT FOUND"<<"\n";
}

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(nullptr),cout.tie(nullptr);

    int T=1;
    // cin>>T;
    while(T--){
        solve();
    }
}