#include <atcoder/segtree.hpp>
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep2(i, a, b) rep3(i, a, b, 1)
#define rep1(i, n) rep2(i, 0, n)
#define rep0(n) rep1(aaaaa, n)
#define ov4(a, b, c, d, name, ...) name
#define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define per(i, a, b) for (ll i = (a) - 1; i >= (b); i--)
#define fore(e, v) for (auto &&e : v)
#define all(a) begin(a), end(a)
#define sz(a) (ssize(a))
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define eb emplace_back

template <typename T, typename S> bool chmin(T &a, const S &b) {
  return a > b ? a = b, 1 : 0;
}
template <typename T, typename S> bool chmax(T &a, const S &b) {
  return a < b ? a = b, 1 : 0;
}
const int INF = 1e9 + 100;
const ll INFL = 3e18 + 100;
#define i128 __int128_t
struct _ {
  _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }
} __;

ll seg_op(ll a, ll b) { return a + b; }
ll seg_e() { return 0; }

int main() {
  int N;
  cin >> N;
  vl X(N);
  rep(i, 1, N) {
    cout << "? 1 " << (i + 1) << endl;
    ll t;
    cin >> t;
    X[i] = t;
  }
  atcoder::segtree<ll, seg_op, seg_e> seg(vl(N, 1));
  vi P(N);
  per(i, N, 1) {
    int t = X[i] == X[i - 1] ? seg.min_left(N, [&](ll v) { return v < 1; })
                             : seg.min_left(N, [&](ll v) -> bool {
                                 return v <= X[i] - X[i - 1];
                               });
    P[i] = t;
    seg.set(t-1, 0);
  }
  P[0] = seg.min_left(N, [&](ll v) -> bool { return v < 1; });
  cout << "!";
  fore(i, P) cout << " " << i;
  cout << endl;
}