#define _USE_MATH_DEFINES #include using namespace std; #define FOR(i,m,n) for(int i=(m);i<(n);++i) #define REP(i,n) FOR(i,0,n) #define ALL(v) (v).begin(),(v).end() using ll = long long; const int INF = 0x3f3f3f3f; const ll LINF = 0x3f3f3f3f3f3f3f3fLL; const double EPS = 1e-8; const int MOD = 1000000007; // const int MOD = 998244353; const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1}; const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1}; template inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; } template inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; } struct IOSetup { IOSetup() { cin.tie(nullptr); ios_base::sync_with_stdio(false); cout << fixed << setprecision(20); } } iosetup; int query(int x, int y) { cout << "? " << x + 1 << ' ' << y + 1 << endl; int ans; cin >> ans; return ans - 1; } int main() { int n; cin >> n; vector par(n, true); int now; vector gre{0, 1}; while (true) { int a = gre[0], b = gre[1]; gre.clear(); if (query(a, b) == a) { gre.emplace_back(a); now = b; } else { gre.emplace_back(b); now = a; } REP(i, n) { if (i == now || !par[i] || count(ALL(gre), i) == 1) continue; if (query(now, i) == now) { par[i] = false; } else { gre.emplace_back(i); } if (gre.size() == 2) break; } if (gre.size() == 1) { cout << "! " << now + 1 << endl; return 0; } } }