#include <bits/stdc++.h>
// #pragma GCC optimize(2)
#define int long long
using namespace std;
#define pii pair<int, int>
const int MAX = 5e3;
const int N = MAX + 10;
const int INF = 1e18, MOD = 998244353;

int a[N][N], aa[N][N];

inline void solve() {
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            char ch;
            cin >> ch;
            if (ch == '0') {
                a[i][j] = 0;
            } else {
                a[i][j] = 1;
            }
        }
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            for (int k = 1; k <= n; k++) {
                if ((a[i][k] & a[k][j]) == 1) {
                    aa[i][j] = 1;
                    break;
                }
            }
        }
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            a[i][j] |= aa[i][j];
        }
    }

    // for (int i = 1; i <= n; i++) {
    //     for (int j = 1; j <= n; j++) {
    //         cout << a[i][j];
    //     }
    //     cout << "\n";
    // }

    vector<int> out;
    for (int i = 1; i <= n; i++) {
        bool ok = true;
        for (int j = 1; j <= n; j++) {
            if (i == j) continue;
            if (a[i][j] == 0) {
                ok = false;
                break;
            }
        }
        if (ok) {
            out.push_back(i);
        }
        if (out.size() >= 3) break;
    }
    if (out.size() < 3) {
        cout << "NOT FOUND\n";
    } else {
        for (int x : out) {
            cout << x << " ";
        }
        cout << "\n";
    }
}

signed main() {
#ifdef Local
    freopen("D:/vs/in.txt", "r", stdin);
    // freopen("D:/vs/out.txt","w",stdout);
    clock_t start_time = clock();
#else
    ios::sync_with_stdio(0);
    cin.tie(nullptr);
#endif  // Local
    int T = 1;
    // cin >> T;
    while (T--) {
        solve();
    }
#ifdef Local
    cout << "Used " << (double)(clock() - start_time) << " ms" << endl;
#endif
    return 0;
}