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

const int N = 5e3 + 5;

bitset<N> G[N];

bool cmp(int i, int j) {
    return G[i].count() > G[j].count();
}

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<int> a(n);
    for (int i = 0;i < n;i++) {
        a[i] = i;
    }
    sort(a.begin(), a.end(), cmp);
    vector<int> ans;
    ans.push_back(a[0]);
    for (int i = 1;i < n;i++) {
        bitset<N> tmp = G[a[i]];
        tmp[a[i]] = 1;
        int ok = 1;
        for (int x : ans) {
            if ((G[x] & tmp) == tmp) {
                ok = 0;
                break;
            }
        }
        if (ok) ans.push_back(a[i]);
        if (ans.size() >= 3) {
            for (int x : ans) {
                cout << x + 1 << " ";
            }
            cout << '\n';
            return 0;
        }
    }
    cout << "NOT FONUD" << '\n';
}