#include<bits/stdc++.h>
using namespace std;
using ll = long long;

const int N = 5e3 + 5;

bitset<N> G[N];

int main() {
    int n; cin >> n;
    for (int i = 0;i < n;i++) {
        string s; cin >> s;
        for (int j = 0;j < s.size();j++) {
            G[i][j] = s[j] - '0';
        }
    }
    vector<pair<int, int>> a(n);
    for (int i = 0;i < n;i++) {
        a[i].first = G[i].count(), a[i].second = i;
    }
    // auto cmp = [&](int i, int j) -> bool {
    //     return G[i].count() > G[j].count();
    // };
    sort(a.rbegin(), a.rend());
    // reverse(a.begin(), a.end());
    // for (int i = 0;i < n;i++) {
    //     cout << a[i].second << " " << a[i].first << '\n';
    // }
    vector<int> ans;
    ans.push_back(a[0].second);
    for (int i = 1;i < n;i++) {
        int tt = a[i].second;
        bitset<N> tmp = G[tt];
        tmp[tt] = 1;
        // cout << tt << ": " << tmp << '\n';
        int ok = 1;
        for (int x : ans) {
            if ((G[x] & tmp) == tmp) {
                ok = 0;
                break;
            }
        }
        if (ok) ans.push_back(tt);
        if (ans.size() >= 3) {
            for (int x : ans) {
                cout << x + 1 << " ";
            }
            cout << '\n';
            return 0;
        }
    }
    cout << "NOT FONUD" << '\n';
}