#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() {cerr << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
	cerr<<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];

int ask(int a, int b) {
	cout << "? " << a + 1 << " " << b + 1 << endl;
	int c; cin >> c;
	return c - 1;
}


int choose_fst(vector<int> vec) {
	int f = vec[0];
	rep(i, 1, sz(vec)) {
		int a = vec[i];
		int c = ask(a, f);
		if(c == a) f = a;
	}
	return f;
}

pi choose_sec(vector<int> vec) {
	int idx = rand() % sz(vec);
	int f = vec[idx];
	vec.erase(vec.begin() + idx);
	vector<int> cand;
	while(!vec.empty()) {
		vector<int> nvec;
		idx = rand() % sz(vec);
		int d = vec[idx];
		vec.erase(vec.begin() + idx);
		int c = ask(f, d);
		if(f == c) cand.pb(d);
		else {
			cand.clear(); cand.pb(f);
			f = d;
		}
	}
	return pi(f, choose_fst(cand));
}

int erase_rand(vector<int>& vec) {
	int idx = rand() % sz(vec);
	int b = vec[idx];
	vec.erase(vec.begin() + idx);
	return b;
}

int choose_sec_rec(vector<int> vec) {
	vector<int> cand;
	vector<int> bigger;
	rep(i, 0, 25) cand.pb(erase_rand(vec));
	int f = choose_fst(cand);
	bigger.pb(f);
	rep(i, 0, sz(vec)) {
		if(vec[i] == ask(f, vec[i])) bigger.pb(vec[i]);
	}
	debug(sz(bigger), bigger);
	if(sz(bigger) >= 2) {
		return choose_sec(bigger).sec;
	}
	else exit(1);
}

void solve() {
	cin >> N;
	vector<int> vec;
	rep(i, 0, N) vec.pb(i);
	srand((unsigned) time(NULL));
	if(N <= 150) cout << "! " << choose_sec(vec).sec + 1 << "\n";
	else cout << "! " << choose_sec_rec(vec) + 1 << "\n";
}

int main() {
	solve();
}