#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}

int query(int a,int b){
    cout<<"? "<<a+1<<" "<<b+1<<endl;
    int res;
    cin>>res;res--;
    return res;
}

signed main(){
    int n;cin>>n;

    using P=pair<int,int>;
    priority_queue<P,vector<P>,greater<P>> que;

    vector<vector<int>> v(n);
    rep(i,n){
        v[i].push_back(i);
        que.emplace(1,i);
    }

    while(que.size()>1){
        auto lp=que.top();que.pop();
        auto rp=que.top();que.pop();

        int l=lp.second,r=rp.second;

        vector<int> nx;
        for(int i=0,j=0;i<v[l].size() or j<v[r].size();){
            if(nx.size()>=2) break;

            int win=-1;
            if(i==v[l].size()) win=v[r][j++];
            else if(j==v[r].size()) win=v[l][i++];
            else{
                win=query(v[l][i],v[r][j]);
                if(v[l][i]==win) i++;
                else             j++;
            }

            nx.push_back(win);
        }

        v[l]=nx;
        que.emplace(v[l].size(),l);
    }
    cout<<"! "<<(v[0][1]+1)<<endl;
    return 0;
}