#include <bits/stdc++.h>
using namespace std;
#define V vector
#define all0(x) (x).begin(),(x).end()
#define all1(x) (x).begin()+1,(x).end()
#define pb push_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define cin std::cin
#define cout std::cout
typedef long long LL;
typedef pair<int, int> pi;
typedef pair<LL, LL> pl;

//const int MN = 2e5 + 20;
const int INF = 2e9 + 1000;//INF
const LL INFLL = 8e18 + 1000;//INF long long 
mt19937 mrand(chrono::steady_clock().now().time_since_epoch().count());
//模板区域~~~~~~~

//模板结束~~~~~~~

void solve() {
    int n; cin >> n;
    V<V<int>> E(n + 1, V<int>(n + 1));
    V<int> sum(n + 1);
    for(int i = 1; i <= n; i++) {
        string s; cin >> s;
        for(int j = 1; j <= n; j++) E[i][j] = s[j - 1] - '0';
        sum[i] = accumulate(all1(E[i]), 0);
    }
    auto get_mx = [&](V<int> id) -> int {
        if(id.empty()) return 0;
        int mx = 0;
        int ans;
        for(auto x : id) {
            if(sum[x] > mx) mx = sum[x], ans = x;
        }
        return ans;
    };

    V<int> id;
    for(int i = 1; i <= n; i++) id.pb(i);
    int a = get_mx(id);
    id.clear();
    for(int i = 1; i <= n; i++) {
        if(E[i][a]) id.pb(i);
    }
    if(id.empty()) {
        cout << "NOT FOUND" << endl;
        return; 
    }
    int b = get_mx(id);
    id.clear();
    for(int i = 1; i <= n; i++) {
        if(E[i][b]) id.pb(i);
    }
    if(id.empty()) {
        cout << "NOT FOUND" << endl;
        return; 
    }
    int c = get_mx(id);
    cout << a << " " << b << " " << c << endl;
}

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