#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


int uf[2010];
int root(int u) {
  return (uf[u] < 0) ? u : (uf[u] = root(uf[u]));
}
bool connect(int u, int v) {
  u = root(u);
  v = root(v);
  if (u == v) return false;
  if (uf[u] > uf[v]) swap(u, v);
  uf[u] += uf[v];
  uf[v] = u;
  return true;
}


int N;
vector<int> P, Q;

int Ask(int l, int r) {
  if (l == r) return 0;
  assert(0 <= l); assert(l < r); assert(r <= N);
  printf("? %d %d\n", l + 1, r);
  fflush(stdout);
  int ret;
  scanf("%d", &ret);
  return ret;
}

// inv[l, r) mod 2
int sub(int l, int r) {
  int id = 0;
  vector<int> ps(r-l, 0);
  for (int x = 0; x < r; ++x) {
    if (l <= Q[x]) {
      ps[Q[x] - l] = id++;
    }
  }
  fill(uf, uf + (r-l), -1);
  for (int u = 0; u < r-l; ++u) {
    connect(u, ps[u]);
  }
  int ret = r-l;
  for (int u = 0; u < r-l; ++u) if (uf[u] < 0) {
    --ret;
  }
// cerr<<"sub ["<<l<<", "<<r<<"): "<<ps<<" "<<ret<<endl;
  return (ret & 1);
}

// P[l] < P[r]
bool calc(int l, int r) {
  int sum = 0;
  sum ^= sub(l, r);
  sum ^= sub(l + 1, r);
  sum ^= Ask(l, r + 1);
  sum ^= Ask(l + 1, r + 1);
  return !(sum & 1);
}

int main() {
  scanf("%d", &N);
  
  P.assign(N, -1);
  Q.assign(N, -1);
  for (int i = 0; i < N; ++i) {
    int lo = -1, hi = i;
    for (; lo + 1 < hi; ) {
      const int mid = (lo + hi) / 2;
      (calc(Q[mid], i) ? lo : hi) = mid;
    }
    for (int x = hi; x < i; ++x) {
      ++P[Q[x]];
    }
    P[i] = hi;
    for (int j = 0; j <= i; ++j) {
      Q[P[j]] = j;
    }
// cerr<<"P = "<<P<<", Q = "<<Q<<endl;
  }
  
  printf("!");
  for (int i = 0; i < N; ++i) {
    printf(" %d", P[i] + 1);
  }
  puts("");
  fflush(stdout);
  
  return 0;
}