#include <bits/stdc++.h>

#define forn(i,n) for(int i=0; i < n; ++i)
#define for1(i,n) for(int i=1; i <= n; ++i)
#define fore(i,l,r) for(int i=l; i <= r; ++i)
#define pb push_back
#define el '\n'
#define sz(v) int(v.size())
#define d(v) cout << #v << " : " << v << el;

using namespace std;

typedef vector<int> vi;
const int N = 2001;
int cur, suf[N];

int ask(int l, int r){
  if(l >= r) return 0;
  if(r <= cur) return suf[l];// MENOR IGUAL
  cout << "? " << l+1 << " " << r+1 << endl;
  int inv; cin >> inv;
  return inv;
}

int main(){
  ios_base::sync_with_stdio(0); cin.tie(0);
  int n; cin >> n;
  if(n == 1){
    cout << "! " << 1 << endl;
    return 0;
  }
  vi pos(n+1), val(n+1);
  if(ask(0, 1)){
    val[0] = 1; val[1] = 0;
    pos[0] = 1; pos[1] = 0;
    suf[0] = 1;
  } else{
    val[0] = pos[0] = 0;
    val[1] = pos[1] = 1;// SETTEAR BIEN ÍNDICES
  }
  fore(i, 2, n-1){
    int l = -1, r = i;   // (L, R) NO SE SI EL OTRO BINARY FUNCIONABA
    cur = i-1;

    while(l+1 < r){
      int m = (l + r) / 2;
      int pm = pos[m];
      int inv = ask(pm, i) ^ ask(pm+1, i) ^ ask(pm, i-1) ^ ask(pm+1, i-1);
 
      if(inv) r = m;  // MINIMIZAR EL MAYOR
      else l = m;
    }

    forn(j, i) if(val[j] >= r) ++val[j];
    val[i] = r;

    forn(j, i+1) pos[val[j]] = j;
    int j = i-1, par = 0;
    while(j >= 0){
      par ^= val[j] > val[i];
      suf[j] ^= par;

      --j;
    }
  }
  cout << "! ";
  forn(i, n) cout << val[i]+1 << " ";
  cout << endl;
}