#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cassert>
#include <cstdint>
#include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <numeric>
#include <bitset>

using namespace std;

using ll =  long long;
using Pll = pair<ll, ll>;
using Pii = pair<int, int>;

constexpr ll MOD = 1000000007;
constexpr long double EPS = 1e-10;
constexpr int dyx[4][2] = {
    { 0, 1}, {-1, 0}, {0,-1}, {1, 0}
};

int main() {
    int n, winner;
    cin >> n;
    vector<int> v(2, -1), lose(n+1, -1), cand;

    for(int i=0;i<n;++i) cand.push_back(i+1);
    while(cand.size() > 1) {
        vector<int> next_cand;
        for(int i=0;i<cand.size();i+=2) {
            if(i == cand.size()-1) {
                next_cand.push_back(cand[i]);
                continue;
            }
            cout << "? " << cand[i] << ' ' << cand[i+1] << endl;
            cin >> winner;
            next_cand.push_back(winner);
            if(winner == cand[i]) {
                lose[cand[i+1]] = cand[i];
            } else {
                lose[cand[i]] = cand[i+1];
            }
        }
        swap(cand, next_cand);
    }
    v[0] = cand[0];

    cand.clear();
    for(int i=1;i<=n;++i) {
        if(lose[i] == v[0]) {
            cand.push_back(i);
        }
    }

    while(cand.size() > 1) {
        vector<int> next_cand;
        for(int i=0;i<cand.size();i+=2) {
            if(i == cand.size()-1) {
                next_cand.push_back(cand[i]);
                continue;
            }
            cout << "? " << cand[i] << ' ' << cand[i+1] << endl;
            cin >> winner;
            next_cand.push_back(winner);
        }
        swap(cand, next_cand);
    }

    cout << "! " << cand[0] << endl;
}