#include<bits/stdc++.h>
using namespace std;

vector<int>ask(vector<int>A){
  cout << "?";
  for(int i = 0; i < A.size(); i++){
    cout << " " << A[i];
  }
  cout << endl;
  vector<int>B(A.size() + 1);
  for(int i = 0; i < A.size() + 1; i++){
    cin >> B[i];
  }
  return B;
}

struct RandomNumberGenerator {
  mt19937_64 mt;

  RandomNumberGenerator() : mt(chrono::steady_clock::now().time_since_epoch().count()) {}

  int operator()(int a, int b) { // [a, b)
    uniform_int_distribution< int > dist(a, b - 1);
    return dist(mt);
  }

  int operator()(int b) { // [0, b)
    return (*this)(0, b);
  }
};
RandomNumberGenerator rng;

int main(){
  int N;
  cin >> N;
  vector<int>P(N, -1);
  vector<int>l(N, 1), r(N, N), used(N + 1, 0);
  int num = 10;
  while(*min_element(P.begin(), P.end()) == -1){
    num--;
    if(num<0)break;
    vector<int>A(N - 1);
    for(int i = 0; i < N - 1; i++){
      A[i] = rng(0, 2);
    }
    auto B = ask(A);
    P[0] = B[0];
    for(int i = 1; i < N; i++){
      if(B[i] != B[i - 1]){
        P[i] = B[i];
      }
      else{
        if(A[i - 1] == 0){
          l[i] = B[i];
        }
        else{
          r[i] = B[i];
        }
      }
    }
  }
  vector<int>ord;
  for(int i = 0; i < N; i++){
    if(P[i] != -1){
      used[P[i]] = true;
    }
    else{
      ord.push_back(i);
    }
  }
  sort(ord.begin(),ord.end(),[&](int i,int j){
    return r[i] - l[i] < r[j] - l[j];
  });
  for(auto i:ord){
    if(P[i] == -1){
      for(int j = l[i]; j <= r[i]; j++){
        if(!used[j]){
          used[j] = true;
          P[i] = j;
          break;
        }
      }
    }
  }
  cout << "!";
  for(int i = 0; i < N; i++){
    cout << " " << P[i];
  }
  cout << endl;
  return 0;
}