#include <bits/stdc++.h>

using namespace std;

const int N = 2010;
int num, a[N], f[N];

struct SAM {
  unordered_map<int, int> son[N];
  int fa[N], len[N], las, cnt;
  void clear() {
    for (int i = 1; i <= cnt; i++) son[i].clear();
    las = cnt = 1;
  }
  void insert(int c) {
    int p = las, cur = ++cnt;
    len[cur] = len[p] + 1, las = cur;
    while (!son[p][c]) son[p][c] = cur, p = fa[p];
    if (!p) fa[cur] = 1;
    else {
      int q = son[p][c];
      if (len[q] == len[p] + 1) fa[cur] = q;
      else {
        int nq = ++cnt;
        son[nq] = son[q];
        fa[nq] = fa[q], len[nq] = len[p] + 1, fa[cur] = fa[cur] = nq;
        while (son[p][c] == q) son[p][c] = nq, p = fa[p];
      }
    }
    num += len[cur] - len[fa[cur]];
  }
} S;

int main() {
  // cin.tie(0)->sync_with_stdio(0);
  int n;
  cin >> n;
  auto query = [&](int l, int r) {
    cout << "? " << l << ' ' << r << '\n';
    cout.flush();
    int x;
    cin >> x;
    return x;
  };
  int cnt = 0;
  for (int i = 1; i <= n; i++) {
    int l = 1, r = i - 1, p = i;
    while (l <= r) {
      int m = (l + r) / 2;
      if (query(m, i) != f[m] + i - m + 1) p = m, l = m + 1;
      else r = m - 1;
    }
    a[i] = p == i ? ++cnt : a[p];
    S.clear(), num = 0;
    for (int j = i; j >= 1; j--) S.insert(a[j]), f[j] = num;
  }
  cout << "! ";
  for (int i = 1; i <= n; i++) cout << a[i] << " \n"[i == n];
  cout.flush();
  return 0;
}