#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

#define A(a) begin(a),end(a)

struct chash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};
template<typename T, typename U> using pb_map = gp_hash_table<T, U, chash>;
template<typename T> using pb_set = gp_hash_table<T, null_type, chash>;
#define K first
#define V second

using ll = long long;
using ld = long double;

using vi = vector<int>;
using vii = vector<vector<int>>;
typedef vector<ll> vll;
using pll = pair<ll,ll>;
using pii = pair<int,int>;

constexpr ll NN = 2e5, M = 1000000007, L = 20, oo = 1e14;

void run()
{
    int n; cin >> n, n = 1<<n;
    vi a(n); for(int &x : a) cin >> x;
    random_device rd;
    mt19937 gen(rd());
    uniform_int_distribution<int> dist(0, n-1);
    if(n == (1<<12) and 0 ){
        for(int i=0;i<n;i++){
            int idx = i;
            for(int j = 0;j<n;j++){
                if(a[idx]+a[j] < a[idx|j]+a[idx&j])
                    return void(cout << idx << " " << j << '\n');
            }
        }   
    }
    else{
        for(int i=0;i<2500;i++){
            int idx = dist(gen);
            for(int j = 0;j<n;j++){
                if(a[idx]+a[j] < a[idx|j]+a[idx&j])
                    return void(cout << idx << " " << j << '\n');
            }
        }
    }
    cout << "-1\n";
}

int main()
{
    //KING OF THE WORLD...... U.W.T.B
    cin.tie(0);
    run();
}