#include using namespace std; typedef long long ll; typedef long double ld; #define REP(i, n) for (int i = 0; i < (n); ++i) #define REPR(i, n) for (int i = n - 1; i >= 0; --i) #define FOR(i, m, n) for (int i = m; i < n; ++i) #define FORR(i, m, n) for (int i = m; i >= n; --i) #define ALL(v) (v).begin(),(v).end() #define ALLR(v) (v).rbegin(),(v).rend() #define fi first #define se second #define PB push_back #define EB emplace_back using P = pair; template using PQ = priority_queue; template using QP = priority_queue,greater>; templatevoid debug(const T &v,ll h,ll w){for(ll i=0;ivoid debug(const T &v,ll n){for(ll i=0;ivoid debug(const vector&v){debug(v,v.size());} templatevoid debug(const vector>&v){for(auto &vv:v)debug(vv,vv.size());} templatevoid debug(stack st){while(!st.empty()){cout<void debug(queue st){while(!st.empty()){cout<void debug(deque st){while(!st.empty()){cout<void debug(PQ st){while(!st.empty()){cout<void debug(QP st){while(!st.empty()){cout<void debug(const set&v){for(auto z:v)cout<void debug(const multiset&v){for(auto z:v)cout<void debug(const array &a){for(auto z:a)cout<void debug(const map&v){for(auto z:v)cout<<"["<bool chmax(T &a, const T &b) { if (abool chmin(T &a, const T &b) { if (b> n; int cnt=334; vector> x(n+1); queue q; FOR(i,1,n+1) q.push(i); while(q.size()>1){ int u=q.front();q.pop(); int v=q.front();q.pop(); cout << "? " << u << " " << v << endl; int res;cin >> res; q.push(res); if(u==res) x[u].PB(v); else x[v].PB(u); } int mx=q.front();q.pop(); for(auto t:x[mx]) q.push(t); while(q.size()>1){ int u=q.front();q.pop(); int v=q.front();q.pop(); cout << "? " << u << " " << v << endl; int res;cin >> res; q.push(res); if(u==res) x[u].PB(v); else x[v].PB(u); } int ans=q.front(); cout << "! " << ans << endl; }