import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int N;

int Ask(int[] qs) {
  write("?");
  foreach (i; 0 .. N) write(" ", qs[i]);
  writeln;
  stdout.flush;
  const ret = readInt;
  return ret;
}

void Answer(int[] ps) {
  write("!");
  foreach (i; 0 .. N) write(" ", ps[i]);
  writeln;
  stdout.flush;
}

void main() {
  N = readInt;
  
  int[] ans;
  auto xs = iota(1, N + 1).array;
  foreach (i; 0 .. N) {
    int lo = 0, hi = cast(int)(xs.length);
    for (; lo + 1 < hi; ) {
      const mid = (lo + hi) / 2;
      (Ask(ans ~ xs[mid] ~ xs[0 .. mid] ~ xs[mid + 1 .. $]) ? lo : hi) = mid;
    }
    ans ~= xs[lo];
    xs = xs[0 .. lo] ~ xs[lo + 1 .. $];
  }
  Answer(ans);
}