#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 Q=0;

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

pair<int,vector<int>> solve(vector<int> v){
    int n=(int)v.size();

    vector<vector<int>> loser(100000);
    
    while(v.size()>1){
        int m=(int)v.size();
        vector<int> nx;
        rep(i,m/2){
            int l=v[2*i],r=v[2*i+1];
            int win=query(l,r);
            // r wins
            if(l==win) swap(l,r);
            loser[r].push_back(l);
            nx.push_back(r);
        }
        if(m&1) nx.push_back(v.back());
        swap(v,nx);
    }
    int winner=v[0];
    return {winner,loser[winner]};
}



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

    vector<int> ord(n);
    iota(ALL(ord),0);
    auto p=solve(ord);
    auto pp=solve(p.second);
    cout<<"! "<<(pp.first+1)<<endl;
    return 0;
}