#include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>
#include<list>

using namespace std;

#define int long long
#define rep(i,n) for(int i = 0; i < (n); i++)
#define endl "\n"

const long long INF = (long long)1e18;
const long long MOD = (long long)1e9 + 7; 

string yn(bool f){return f?"Yes":"No";}
string YN(bool f){return f?"YES":"NO";}

#define MAX

signed main(){
	// cin.tie(0);
	// ios::sync_with_stdio(false);
	// cout<<fixed<<setprecision(10);
	
	int N, win;
	vector<pair<pair<int,int>,int>> x;
	list<int> lst, lst2;
	
	cin>>N;
	
	for(int i = 1; i <= N; i++){
		lst.push_back(i);
	}
	
	while(lst.size() != 1){
		for(list<int>::iterator  itr = ++lst.begin(); itr != lst.end(); itr++){
			auto itr1 = --itr; itr++;
			
			int ans, temp;
			
			cout<<"? "<<*itr1<<" "<<*itr<<endl;
			
			cin>>ans;
			
			temp = *itr;
			
			x.push_back(make_pair(make_pair(*itr1, *itr), ans));
			
			if(temp == ans) {
				lst.erase(itr1);
				if(++itr == lst.end()) break;
			} else {
				itr = lst.erase(itr);
				if(itr == lst.end()) break;
			}
		}
	}
	
	win = *lst.begin();
	
	for(int i = 0; i < x.size(); i++){
		if(x[i].second == win) lst2.push_back(x[i].first.first == win ? x[i].first.second : x[i].first.second);
	}
	
	while(lst2.size() != 1){
		for(list<int>::iterator  itr = ++lst2.begin(); itr != lst2.end(); itr++){
			auto itr1 = --itr; itr++;
			
			int ans, temp;
			
			cout<<"? "<<*itr1<<" "<<*itr<<endl;
			
			cin>>ans;
			
			temp = *itr;
			
			if(temp == ans) {
				lst2.erase(itr1);
				if(++itr == lst2.end()) break;
			} else {
				itr = lst2.erase(itr);
				if(itr == lst2.end()) break;
			}
		}
	}
	
	cout<<"! "<<*lst2.begin()<<endl;
	return 0;
}