#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define sz(v) int((v).size())
#define all(v) (v).begin(),(v).end()
#define endl "\n"
#define no cout<<"NO"<<endl;
#define yes cout<<"YES"<<endl;
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;
typedef double db;
const db eps = 1e-8;
#define inf 1e18
#define ret {cout<<-1<<endl;return;}
template<typename T> bool gmax(T &x,const T y){if(x<y)return x=y,1;return 0;}
template<typename T> bool gmin(T &x,const T y){if(y<x)return x=y,1;return 0;}
#define maxn 5010
vector<int>g[maxn];
int vis[maxn];
void solve()
{
    int n;
    cin>>n;
    string s;
    rep(i,0,n-1)
    {
        cin>>s;
        rep(j,0,n-1)
        {
            if(s[j]=='1') g[i].push_back(j);
        }
    }
    int cnt=0;
    vector<int>v;
    rep(i,0,n-1)
    {
        int c=0;
        rep(i,0,n-1) vis[i]=0;
        for(auto v:g[i])
        {
            vis[v]=1;
            for(auto x:g[v])
            {
                vis[x]=1;
            }
        }
        vis[i]=0;
        rep(j,0,n-1) if(vis[j]) c++;
        if(c==n-1) v.push_back(i),cnt++;
        if(cnt==3) break;
    }
    if(sz(v)==3)
    {
        for(auto x:v)
        {
            cout<<x+1<<" ";
        }
    }
    else 
    {
        cout<<"NOT FOUND"<<endl;
    }
}
signed main()
{
	ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
	int t=1;
	//cin>>t;
	while(t--)solve();
}
//循环边界
//二分l和r的范围
//数组越界
//在函数内开数组赋初值
//long long
//尽量用数学语言刻画
//从直觉到严谨分析，推导
//冷静，冷静，冷静
// if(mp[x]) 会生成新的键值