#include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod = 998244353;
const int N = 5e3 + 10;
int a[N][N];
void solve() {
    int n; cin >> n;
    vector< int > in(n + 1, 0);
    for(int i = 1; i <= n; i++) {
        string s; cin >> s; s = '-' + s;
        for(int j = 1; j <= n; j++) {
            a[i][j] = s[j] - '0';
            if(s[j] == '1') {
                in[j]++;
            }
        }
    }
    vector< int > p(n + 1);
    iota(p.begin(), p.end(), 0);
    sort(p.begin() + 1, p.end(), [&](int x, int y) -> bool {return in[x] < in[y]; });
    int ansa= p[1];
    int ansb= -1, ansc= -1;
    int cnt= -1;
    for(int i= 1;i<=n;i++)
    {
        if(i==ansa|| a[ansa][i])continue;
        int cur= 0;
        for(int j=1;j<=n;j++)
        {
            if(j==ansa||a[ansa][j]){
                continue;
            }
            cur+=a[i][j];
        }
        if(cur> cnt)
        {
            cnt= cur;
            ansb= i;
        }
    }
    if(ansb==-1)
    {
        cout<<"NOT FOUND\n";
        return ;
    }
    cnt= -1;
    for(int i= 1;i<=n;i++)
    {
        if(i==ansa || a[i][ansa])continue;
        int cur= 0;
        bool flag = 0;
        for(int j= 1;j<=n;j++)
        {
            if(j==ansa)continue;
            if(a[j][ansa] && a[i][j])flag = 1;
            cur+=a[i][j] ; 
        }
        if(cur> cnt && flag)
        {
            cnt= cur;
            ansc= i;
        }
    }
    if(ansc==-1)
    {
        cout<<"NOT FOUND\n";
        return ;
    }
    cout<<ansa<<" "<<ansb<<" "<<ansc<<"\n";
}

signed main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int t = 1;
    while(t--) {
        solve();
    }
}