#include <bits/stdc++.h>
using namespace std;
#define int long long
int __ = 1,n;
const int N=5050;
bitset<N> a[N],b[N],c[N];
void solve(){
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            char c;cin>>c;
            bool now=c-'0';
            a[i][j]=now;
            b[j][i]=now;
        }
    }
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
        {
           bitset<N> t = a[i]&b[j];
            // cout<<i<<" "<<j<<endl;
            // cout << a[i] << endl;
            // cout << b[j] << endl;
            // cout << t << endl;
            // cout << t.count() << endl;
            if(t.count()) c[i][j] = 1;
            else c[i][j] = 0;
        }
    for(int i=1;i<=n;i++)
        c[i]=c[i]|a[i];
    vector<int>ans;
    for(int i=1;i<=n;i++)
    {
        int cnt=0;
        for(int j=1;j<=n;j++)
            if(c[i][j]&&i!=j)cnt++;
        if(cnt==n - 1)ans.push_back(i);
        if(ans.size()>=3)break;
    }
    if(ans.size()<=2)
    {
        cout<<"NOT FOUND";
    }else
    {
        for(int x:ans)
            cout<<x<<" ";
    }
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);
    __=1;
    //cin >> __;
    while (__--){
        solve();
    }
    return 0;
}