#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cout << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
	cout<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
	out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
	out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 300010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = 1 << 30;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
///////////////////////////////////////////////////////////////////////////////////////////////////

//いい感じに通らないコードを書きたい。

int N;
vector<int> vec;
vector<int> G[MAX_N];

void solve() {
	cin >> N;
	rep(i, 0, N) vec.pb(i);
	int cnt = 334;
	while(sz(vec) >= 2) {
		vector<int> nvec;
		int n = sz(vec);
		for(int i = 0; i < n; i += 2) {
			if(i == n - 1) nvec.pb(vec[i]);
			else {
				int a = vec[i], b = vec[i + 1];
				cout << "? " << a + 1 << " " << b + 1 << endl;
				cnt--;
				int c;
				cin >> c; c--;
				if(b == c) swap(a, b);
				nvec.pb(a);
				G[a].pb(b);
			}
		}
		vec = nvec;
		// debug(vec);
	}
	int root = vec[0];
	int ans = -1;
	// debug(root, G[root]);
	rep(i, 0, sz(G[root])) {
		int b = G[root][i];
		if(ans == -1) ans = b;
		else {
			cout << "? " << ans + 1 << " " << b + 1 << endl;
			cnt--;
			int c;
			cin >> c; c--;
			if(b == c) ans = b;
		}
	}
	while(cnt--) {
		cout << "? " << 1 << " " << 2 << endl;
	}
	cout << "! " << ans + 1 << endl;
}

int main() {
	solve();
}