#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 tournament(const vector &v, vector &nv) { int n = v.size(); int k = 1; while (k < n) k *= 2; vector> opp(n + 1); vector result(k + k - 1, -1); rep(i, n) result[k + i - 1] = v[i]; int l = k - 1, r = k + k - 1; while (r - l > 1) { for (int i = l; i < r; i += 2) { if (result[i] == -1) break; if (result[i + 1] == -1) { result[i / 2] = result[i]; continue; } query(result[i], result[i + 1]); opp[result[i]].push_back(result[i + 1]); opp[result[i + 1]].push_back(result[i]); int t; cin >> t; result[i / 2] = t; } for (const auto &e : result) cout << e << " "; cout << endl; l /= 2, r /= 2; } nv = opp[result[0]]; return result[0]; } int main() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); int n; 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; }