#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;

	vector<int> cand;
	int front = rand() % N;
	vector<int> vec;
	rep(i, 0, N) {
		if(front == i) continue;
		vec.pb(i);
	}
	while(!vec.empty()) {
		int n = sz(vec);
		int b = vec[rand() % n];
		cout << "? " << front + 1 << " " << b + 1 << "\n";
		int c; cin >> c; c--;
		if(c == front) cand.pb(b);
		else {
			cand.clear(); cand.pb(front);
			front = b;
		}
		vector<int> nvec;
		rep(i, 0, sz(vec)) {
			if(vec[i] == b) continue;
			nvec.pb(vec[i]);
		}
		vec = nvec;
		// debug(vec, front, cand);
	}
	int s = cand[0];
	rep(i, 1, sz(cand)) {
		int a = cand[i];
		cout << "? " << s + 1 << " " << a + 1 << "\n";
		int c; cin >> c; c--;
		if(c == a) s = a;
	}
	cout << "! " << s + 1 << "\n";
}

int main() {
	solve();
}