#include // #include using namespace std; // using namespace atcoder; #define rep(i, n) for (int i = 0; i < (n); i++) #define rep1(i, n) for (int i = 1; i <= (n); i++) #define rrep(i, n) for (int i = n - 1; i >= 0; i--) #define rrep1(i, n) for (int i = n; i >= 1; i--) #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define eb emplace_back #define fi first #define se second #define sz(x) (int)(x).size() template using V = vector; template using VV = V>; typedef long long int ll; // typedef modint998244353 mint; void speedUpIO() { cin.tie(nullptr); ios::sync_with_stdio(false); } template bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; } template bool chmin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; } /*--------------------------------------------------*/ typedef pair P; const int INF = 1e9; const ll LINF = 1e18; const int MAX = 1e5; void solve() { int n; cin >> n; V a(n), b(n); set c; rep(i, n) c.insert(i); int i = 0; while (sz(c) > 1) { assert(i < n); int nc = sz(c); map x; int mn = n; for (int cj : c) { cout << "? " << i + 1 << " " << cj + 1 << endl; cin >> x[cj]; chmin(mn, x[cj]); } set cc; for (int cj : c) { if (x[cj] == mn) cc.insert(cj); } c = cc; i++; } assert(sz(c) == 1); rep(ii, n) { cout << "? " << ii + 1 << " " << *c.begin() + 1 << endl; int x; cin >> x; a[ii] = x; if (x == 1) i = ii; } rep(j, n) { cout << "? " << i + 1 << " " << j + 1 << endl; int x; cin >> x; b[j] = x; } cout << "! "; rep(i, n) cout << a[i] << " "; rep(i, n) cout << b[i] << " "; cout << endl; } int main() { speedUpIO(); int t = 1; // cin >> t; while (t--) { solve(); // cout << solve() << "\n"; // cout << (solve() ? "Yes" : "No") << "\n"; // cout << fixed << setprecision(15) << solve() << "\n"; } return 0; }