#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;
}

vector<int> cut_half(vector<int> v){
    vector<int> ret;
    int n=(int)v.size();
    rep(i,n/2) ret.push_back(query(v[2*i],v[2*i+1]));
    if(n&1) ret.push_back(v.back());
    return ret;
}

void solve_all(vector<int> w){
    int n=(int)w.size();

    int sz=1;
    while(sz<n) sz*=2;

    vector<vector<int>> v(sz*2);
    rep(i,n) v[i+sz].push_back(w[i]);

    auto f=[&](int l,int r){
        vector<int> ret;
        for(int i=0,j=0;i<v[l].size() or j<v[r].size();){
            if(ret.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(win==v[l][i]) i++;
                else             j++;
            }
            ret.push_back(win);
        }
        return ret;
    };

    for(int k=sz-1;k>0;k--) v[k]=f(2*k,2*k+1);
    cout<<"! "<<v[1][1]+1<<endl;
}

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

    vector<int> ord(n);
    iota(ALL(ord),0);
    mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
    shuffle(ALL(ord),mt);

    if(n>150) ord=cut_half(ord);
    solve_all(ord);
    return 0;
}