#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
    std::fill( (T*)array, (T*)(array+N), val );
}

int main() {
    ll n;
    std::cin >> n;
    // トーナメントを行って1位と戦って負けたやつの中で一番強いやつ
    vector<ll> next;
    for (int i = 1; i <= n; i++) {
        next.push_back(i);
    }
    vector<ll> list[400];
    while(next.size()!=1){
        vector<ll> next_next;
        for (int i = 0; i < next.size()/2; i++) {
            std::cout << "? "<<next[i*2]<<" "<<next[i*2+1]<< std::endl;
            list[next[i*2]].push_back(next[i*2+1]);
            list[next[i*2+1]].push_back(next[i*2]);
            ll tmp;
            std::cin >> tmp;
            next_next.push_back(tmp);
        }
        if(next.size()%2==1){
            ll a,b;
            a = next_next[next_next.size()-1];
            next_next.erase(next_next.begin()+next_next.size()-1);
            b = next[next.size()-1];
            list[a].push_back(b);
            list[b].push_back(a);
            std::cout << "? "<<a<<" "<<b<< std::endl;
            ll tmp;
            std::cin >> tmp;
            next_next.push_back(tmp);
        }
        next.clear();
        for (auto e : next_next) {
            next.push_back(e);
        }
    }
    ll win = next[0];
    ll now = list[win][0];
    for (int i = 1; i < list[win].size(); i++) {
        std::cout << "? "<<now<<" "<<list[win][i]<< std::endl;
        ll tmp;
        std::cin >> tmp;
        now = tmp;
    }
    std::cout << "! "<<now << std::endl;
}