#include<iostream>
#include<cstring>
#include<vector>
#include<algorithm>
#include<random>
#include<bitset>
using namespace std;
using LL = long long;

template<int len = 1>
void solve(int n){
    if (2 * n > len){
        solve<min(2 * len, 12000)>(n);
        return;
    }
    vector<bitset<len> > bs(n);
    for(int i = 0; i < n; i++){
        string s;
        cin >> s;
        int cur = 0;
        for(auto c : s){
            int x = c - 33;
            for(int j = 0; j < 6; j++){
                if (x >> j & 1){
                    bs[i].set(cur + j);
                }
            }
            cur += 6;
        }
    }
    vector<pair<int, int> > p;
    p.reserve(n * (n - 1) / 2);
    for(int i = 0; i < n; i++){
        for(int j = i + 1; j < n; j++){
            p.push_back({i, j});
        }
    }
    shuffle(p.begin(), p.end(), mt19937_64(1479142375923));
    n /= 2;
    for(auto [l, r] : p){
        if ((bs[l] & bs[r]).count() >= n){
            cout << l + 1 << ' ' << r + 1 << '\n';
            return;
        }
    }
}

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int n;
    cin >> n;
    solve(n);

}