// https://www.youtube.com/watch?v=R0P_f0gXXqs
// I could feel your heartbeat
// I could feel somewhere you’re looking down
// ‘Cause it’s you who I’m loving
// And it’s you that I want in need

#ifndef ONLINE_JUDGE
#include "templates/debug.hpp"
#else
#define debug(...)
#endif

#include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
using u64 = uint64_t;

void solve() {
    int n; cin >> n;
    vector<string> g(n);
    for (auto &s : g) cin >> s;
    vector<int> deg(n);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (g[i][j] == '1') {
                deg[i]++;
            } else {
                deg[j]++;
            }
        }
    }
    int a = ranges::max_element(deg) - deg.begin();
    vector<int> toa(n);
    for (int j = 0; j < n; j++) if (g[j][a] == '1') toa[j] = 1;
    debug(a, toa);
    deg = vector<int>(n);
    for (int j = 0; j < n; j++) {
        for (int k = 0; k < n; k++) {
            if (toa[j] && toa[k]) {
                if (g[j][k] == '1') {
                    deg[j]++;
                } else {
                    deg[k]++;
                }
            }
        }
    }
    int b = ranges::max_element(deg) - deg.begin();
    if (ranges::all_of(toa, [](int x) { return x == 0; })) {
        cout << "NOT FOUND\n";
        return;
    }
    vector<int> s1(n);
    for (int i = 0; i < n; i++) {
        s1[i] = g[a][i] == '1' && g[i][b] == '1';
    }
    deg = vector<int>(n);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (s1[i] && s1[j]) {
                if (g[i][j] == '1') {
                    deg[i]++;
                } else {
                    deg[j]++;
                }
            }
        }
    }
    int c = ranges::max_element(deg) - deg.begin();
    cout << a + 1 << " " << b + 1 << " " << c + 1 << "\n";
}

// Make bold hypotheses and verify carefully
int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    };
}