#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
const ll N = 1000007;

int n;
char a[5010][5010];
int v[5010];

struct zhs{
    int chu;
    int num;
}du[5010];

bool cmp(zhs x,zhs y){
    return x.chu > y.chu;
}

void solve(){
    cin>>n;

    for(int i=1;i<=n;i++){
        du[i].num = i;
        for(int j=1;j<=n;j++){
            cin>>a[i][j];
            if(a[i][j] == '1') du[i].chu++;
        }
    }
    if(n < 3){
        cout<<"NOT FOUND\n";
        return;
    }
    sort(du+1,du+n+1,cmp);
    for(int i=1;i<=n;i++){
        if(a[du[1].num][i] == '1') v[i] = 1;
    }
    int maxnum1 = du[1].num,cnt = 1,maxnum2 = -1,maxnum3 = -1;
    for(int i=2;i<=n;i++){
        if(cnt == 3) break;
        int p = du[i].num;
        int f = 0;
        for(int j=1;j<=n;j++){
            if(a[p][j] == '1' && v[j] == 0){
                f = 1;
                break;
            }
        }
        if(f == 1 && cnt == 1){
            cnt++;
            maxnum2 = p;
            continue;
        }
        if(f == 1 && cnt == 2){
            cnt++;
            maxnum3 = p;
            continue;
        }
    }
    if(maxnum2 == -1 || maxnum3 == -1){
        cout<<"NOT FOUND\n";
    }
    else cout<<maxnum1<<" "<<maxnum2<<" "<<maxnum3<<'\n';
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    ll T=1;
    // cin >> T;
    while(T--){
        solve();
    }
}
/*
 ans=0
 for a in range(1,3):
 for b in range(5,1,-2):
 ans+=b
 print(ans)

 */