#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int main()
{
    int n; cin>>n;
    int ret;
    int mx1=1, mx2=n/2+1;
    for(int i=2; i<=n/2; i++){
        cout<<"? "<<mx1<<" "<<i<<endl;
        cin>>ret;
        if(ret==i){
            mx1=i;
        }
    }
    for(int i=n/2+2; i<=n; i++){
        cout<<"? "<<mx2<<" "<<i<<endl;
        cin>>ret;
        if(ret==i){
            mx2=i;
        }
    }
    cout<<"? "<<mx1<<" "<<mx2<<endl;
    cin>>ret;
    int ans;
    if(ret==mx1){
        if(n/2==1){
            cout<<"! "<<mx2<<endl; return 0;
        }
        ans=1;
        if(ans==mx1) ans=2;
        for(int i=2; i<=n/2; i++){
            if(i==mx1 || ans==i) continue;
            cout<<"? "<<i<<" "<<ans<<endl;
            cin>>ret;
            if(ret==i) ans=i;
        }
        cout<<"? "<<ans<<" "<<mx2<<endl;
        cin>>ret;
        cout<<"! "<<ret<<endl;
    }else{
        if(n-n/2==1){
            cout<<"! "<<mx1<<endl; return 0;
        }
        ans=n/2+1;
        if(ans==mx2) ans=n/2+2;
        for(int i=n/2+2; i<=n; i++){
            if(i==mx2 || ans==i) continue;
            cout<<"? "<<i<<" "<<ans<<endl;
            cin>>ret;
            if(ret==i) ans=i;
        }
        cout<<"? "<<ans<<" "<<mx1<<endl;
        cin>>ret;
        cout<<"! "<<ret<<endl;
    }
    return 0;
}