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

int main(){
    int N;
    cin >> N;
    vector<int> winners(2 * N, 0);
    for (int p = 1; p <= N; ++p) winners[p + N - 1] = p;
    for (int m = N - 1; m > 0; --m){
        cout << "? " << winners[m * 2] << ' ' << winners[m * 2 + 1] << endl;
        int ans;
        cin >> ans;
        winners[m] = ans;
    }
    vector<int> candidates;
    int pos = 1;
    while (pos < N){
        if (winners[pos] = winners[pos * 2]){
            candidates.push_back(winners[pos * 2 + 1]);
            pos = pos * 2;
        }else{
            candidates.push_back(winners[pos * 2]);
            pos = pos * 2 + 1;
        }
    }
    int ans = candidates[0];
    for (int i = 1; i < candidates.size(); ++i){
        cout << "? " << ans << ' ' << candidates[i] << endl;
        cin >> ans;
    }
    cout << "! " << ans << endl;
    return 0;
}