#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using i128 = __int128;
using u128 = unsigned __int128;
template <typename T>
void chkmax(T &x, const T &y) {
  if (x < y) x = y;
}
template <typename T>
void chkmin(T &x, const T &y) {
  if (y < x) x = y;
}
constexpr int MAXN = 2010;
int n, p[MAXN], rev[MAXN], num[MAXN][MAXN];
bool query(int l, int r) {
  if (l == r) return false;
  cout << "? " << l << " " << r << endl;
  bool x;
  cin >> x;
  return x;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> n;
  p[1] = 1;
  rev[1] = 1;
  for (int i = 2; i <= n; ++i) {
    auto check = [&](int pos) {
      return query(pos, i) ^ (num[pos][i - 1] & 1) ^ query(pos + 1, i) ^ (num[pos + 1][i - 1] & 1);
    };
    int l = 1, r = i - 1, res = 0;
    while (l <= r) {
      int mid = (l + r) >> 1;
      if (!check(rev[mid])) {
        res = mid;
        l = mid + 1;
      } else {
        r = mid - 1;
      }
    }
    p[i] = res + 1;
    rev[res + 1] = i;
    for (int j = 1; j < i; ++j) {
      if (p[j] > res) {
        ++p[j];
        rev[p[j]] = j;
      }
    }
    for (int j = i - 1; j >= 1; --j)
      num[j][i] = num[j][i - 1] + num[j + 1][i] - num[j + 1][i - 1] + (p[j] > p[i]);
  }
  cout << "! ";
  for (int i = 1; i <= n; ++i) cout << p[i] << " \n"[i == n];
  cout << flush;
  return 0;
}
/*
g++ F.cpp -o F -std=c++14 -O2 -Wall -Wextra -Wshadow -g -fsanitize=address,undefined
*/