/**
 * @file qoj6303-1.cpp
 * @author n685
 * @brief
 * @date 2024-06-21
 *
 *
 */
#include <bits/stdc++.h>

#ifdef LOCAL
#include "dd/debug.h"
#else
#define dbg(...) 42
#define dbgR(...) 4242
#define dbgP(...) 420
#define dbgRP(...) 420420
void nline() {}
#endif

auto main() -> int {
  std::cin.tie(nullptr)->sync_with_stdio(false);

  int n;
  std::cin >> n;

  std::vector<int> ind;
  std::vector dp(n + 1, std::vector<int>(n + 1));
  auto query = [&](int l, int r) -> int {
    if (r > std::ssize(ind)) {
      std::cout << "? " << l << ' ' << r << '\n' << std::flush;
      int v;
      std::cin >> v;
      return v;
    } else {
      return dp[l][r] % 2;
    }
  };
  auto gr = [&](int l, int r) -> bool {
    if (r - l == 1) {
      return query(l, r);
    } else {
      return ((query(l, r) - query(l + 1, r) - query(l, r - 1) +
               query(l + 1, r - 1)) %
                  2 +
              2) %
             2;
    }
  };

  for (int i = 1; i <= n; ++i) {
    int l = 0, r = i - 2;
    while (l < r) {
      int mid = (l + r) / 2;
      if (gr(ind[mid], i)) {
        r = mid;
      } else {
        l = mid + 1;
      }
    }
    if (l == i - 2 && !gr(ind[l], i)) {
      l = i - 1;
    }
    ind.insert(ind.begin() + l, i);
    std::vector<int> p(i + 1);
    for (int j = 0; j < i; ++j) {
      p[ind[j]] = j;
    }
    dp[i - 1][i] = (p[i - 1] > p[i]);
    for (int j = i - 2; j >= 1; --j) {
      dp[j][i] = (dp[j + 1][i] + dp[j][i - 1] - dp[j + 1][i - 1]) % 2;
      if (dp[j][i] < 0) {
        dp[j][i] += 2;
      }
    }
  }
  std::vector<int> p(n + 1);
  for (int j = 0; j < n; ++j) {
    p[ind[j]] = j;
  }
  std::cout << "! ";
  for (int i = 1; i <= n; ++i) {
    std::cout << p[i] + 1 << ' ';
  }
  std::cout << '\n' << std::flush;
}