#include using namespace std; #define repl(i, l, r) for (int i = (l); i < (int)(r); ++i) #define rep(i, n) repl(i, 0, n) #define CST(x) cout << fixed << setprecision(x) #define all(x) (x).begin(), (x).end() #define sz(x) (int)(x).size() using ll = long long; constexpr ll MOD = 1000000007; constexpr int inf = 1e9 + 10; constexpr ll INF = (ll)4e18 + 10; constexpr int dx[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0}; constexpr int dy[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0}; const double PI = acos(-1); template using MaxHeap = priority_queue; template using MinHeap = priority_queue, greater>; template inline bool chmax(T &a, T b) { return ((a < b) ? (a = b, true) : (false)); } template inline bool chmin(T &a, T b) { return ((a > b) ? (a = b, true) : (false)); } template inline void yn(const T &a) { ((a) ? (cout << "Yes" << endl) : (cout << "No" << endl)); } template inline void YN(const T &a) { ((a) ? (cout << "YES" << endl) : (cout << "NO" << endl)); } void query(const int &x, const int &y) { cout << "? " << x << " " << y << endl; } int n; int tournament(const vector &v, vector &nv) { vector> opp(n + 1); queue que; for (const auto &e : v) que.push(e); while (que.size() > 1) { int a = que.front(); que.pop(); int b = que.front(); que.pop(); query(a, b); opp[a].emplace_back(b), opp[b].emplace_back(a); int t; cin >> t; que.push(t); } int res = que.front(); nv = opp[res]; return res; } int main() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cin >> n; vector v(n); iota(all(v), 1); vector nv; tournament(v, nv); v.assign(n, 0); int ans = tournament(nv, v); cout << "! " << ans << endl; return 0; }