#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
//#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
auto query(vector<int>v, int add = 0) {
	cout << "?";
	rep(i, v.size())cout << " " << v[i] + add;
	cout << endl;
	fflush(stdout);
	//return calc(v);
	int get; cin >> get;
	return get;
}
void answer(vector<int>v, int add = 0) {
	cout << "!";
	cout << " " << v.size();
	rep(i, v.size())cout << " " << v[i] + add;
	cout << endl;
	fflush(stdout);
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<int>lose(n, -1);
	queue<int>que;
	rep(i, n)que.push(i);
	auto f = [&]()->void {
		while (que.size() >= 2) {
			int x = que.front();
			que.pop();
			int y = que.front();
			que.pop();
			cout << "? " << x + 1 << " " << y + 1 << endl;
			fflush(stdout);
			int get; cin >> get; get--;
			if (x == get) {
				que.push(x);
				lose[y] = x;
			}
			else {
				que.push(y);
				lose[x] = y;
			}
		}
	};
	f();
	int win = que.front();
	que.pop();
	rep(i, n) if (win == lose[i])que.push(i);
	f();
	win = que.front();
	que.pop();
	cout << "! " << win + 1 << endl;
	fflush(stdout);
	return 0;
}