/*
 * author:  ADMathNoob
 * created: 04/09/23 02:38:36
 * problem: https://qoj.ac/problem/6303
 */

/*
Comments about problem:


*/

#include <bits/stdc++.h>

using namespace std;

#ifdef _DEBUG
#include "../.cp/algorithms/debug/debug.h"
#else
#define debug(...) 42
#endif

#ifdef _DEBUG

mt19937 rng((unsigned int) chrono::steady_clock::now().time_since_epoch().count());

int RandInt(int low, int high) {
  return low + (rng() % (high - low + 1));
}

int used = 0;
vector<int> answer;

int Ask(int L, int R) {
  assert(++used <= 40000);
  int ret = 0;
  for (int i = L; i <= R; i++) {
    for (int j = i + 1; j <= R; j++) {
      if (answer[i] > answer[j]) {
        ret += 1;
      }
    }
  }
  return ret % 2;
}

void Answer(const vector<int>& p) {
  debug(p, answer);
  assert(p == answer);
}

#else

int used = 0;
map<pair<int, int>, int> mp;

int Ask(int L, int R) {
  if (L == R) return 0;
  if (!mp.count({L, R})) {
    assert(++used <= 40000);
    cout << "? " << L + 1 << ' ' << R + 1 << endl;
    cin >> mp[{L, R}];
  }
  return mp[{L, R}];
}

void Answer(const vector<int>& p) {
  cout << "!";
  for (int x : p) {
    cout << ' ' << x + 1;
  }
  cout << endl;
}

#endif

void SolveOne(int n) {
  vector<int> suf(1, 0);
  for (int it = 1; it < n; it++) {
    vector<int> pos(it);
    for (int i = 0; i < it; i++) {
      pos[suf[i]] = i;
    }
    const int at = n - it - 1;
    // look for smallest that is > x
    int low = 0, high = it;
    while (low < high) {
      int mid = (low + high) / 2;
      int cntL = 0;
      for (int i = 0; i < pos[mid]; i++) {
        cntL += (suf[i] > mid);
      }
      if ((Ask(at, at + pos[mid]) + cntL) % 2 == Ask(at, at + 1 + pos[mid])) {
        high = mid;
      } else {
        low = mid + 1;
      }
    }
    for (int i = 0; i < it; i++) {
      if (suf[i] >= low) {
        suf[i] += 1;
      }
    }
    suf.insert(suf.begin(), low);
  }
  Answer(suf);
}

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);

#ifdef _DEBUG
  const int n = 100;
  for (int it = 0; it < 100; it++) {
    answer.resize(n);
    iota(answer.begin(), answer.end(), 0);
    shuffle(answer.begin(), answer.end(), rng);
    used = 0;
    SolveOne(n);
  }
  return 0;
#else
  int n;
  cin >> n;
  SolveOne(n);
  return 0;
#endif
}