#include<bits/stdc++.h>
#define fore(i,l,r)	for(int i=(int)(l);i<(int)(r);++i)
#define fi first
#define se second
#define endl '\n'
#define ull unsigned long long
#define ALL(v) v.begin(), v.end()
#define Debug(x, ed) std::cerr << #x << " = " << x << ed;

const int INF=0x3f3f3f3f;
const long long INFLL=1e18;

typedef long long ll;

int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    int n;
    std::cin >> n;
    std::vector<std::vector<int>> d(n + 1, std::vector<int>(n + 1, INF));
    std::vector<std::vector<int>> g(n + 1);
    fore(i, 1, n + 1) d[i][i] = 0;
    fore(i, 1, n + 1){
        std::string s;
        std::cin >> s;
        s = '0' + s;
        fore(j, 1, n + 1)
            if(s[j] == '1'){
                g[i].push_back(j);
            }
    }

    auto bfs = [&](int s){
        std::queue<int> q;
        q.push(s);
        while(!q.empty()){
            int u = q.front();
            q.pop();
            for(auto v : g[u])
                if(d[s][u] + 1 < d[s][v]){
                    d[s][v] = d[s][u] + 1;
                    if(d[s][v] != 2) q.push(v);
                }
        }
    };

    fore(i, 1, n + 1){
        bfs(i);
    }

    std::vector<int> ans;
    fore(u, 1, n + 1){
        int mx = 0;
        fore(v, 1, n + 1) mx = std::max(mx, d[u][v]);
        if(mx <= 2) ans.push_back(u);
        if(ans.size() == 3) break;
    }

    if(ans.size() < 3){
        std::cout << "NOT FOUND\n";
        return 0;
    }

    for(auto x : ans) std::cout << x << ' ';
    
    return 0;
}