#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define int long long
using namespace std;
typedef pair<int, int> P;
const int mod = 1000000007;
const int INF = 1e18;

signed main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    vector<int> a;
    rep(i, 0, n) a.push_back(i);
    int win = -1;
    vector<vector<int> > lose(n);
    while(1){
        if(a.size() == 1){
            win = a[0];
            break;
        }
        vector<int> b;
        for(int i = 0; i < a.size() / 2; i++){
            cout << "? " << a[i * 2] + 1 << ' ' << a[i * 2 + 1] + 1 << endl;
            int in;
            cin >> in;
            in--;
            b.push_back(in); 
            if(a[i * 2] == in) lose[a[i * 2]].push_back(a[i * 2 + 1]);
            else lose[a[i * 2 + 1]].push_back(a[i * 2]);
        }
        if(a.size() % 2 == 1){
            b.push_back(a.back());
        }
        a = b;
    }
    a = lose[win];
    int ans = -1;
    while(1){
        if(a.size() == 1){
            ans = a[0];
            break;
        }
        vector<int> b;
        for(int i = 0; i < a.size() / 2; i++){
            cout << "? " << a[i * 2] + 1 << ' ' << a[i * 2 + 1] + 1 << endl;
            int in;
            cin >> in;
            in--;
            b.push_back(in); 
        }
        if(a.size() % 2 == 1){
            b.push_back(a.back());
        }
        a = b;
    }
    cout << "! " << ans + 1 << endl;
}