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] + 1); writeln; stdout.flush; const ret = readInt; return ret; } void Answer(int[] ps) { write("!"); foreach (i; 0 .. N) write(" ", ps[i] + 1); writeln; stdout.flush; } // \sum[0<=i<N] xs[N-1-i] i! int[] toPerm(int[] xs) { auto ps = xs.dup; foreach_reverse (i; 0 .. N) foreach (j; i + 1 .. N) if (ps[i] <= ps[j]) ++ps[j]; // writeln(xs,": ",ps); return ps; } void main() { N = readInt; auto lo = new int[N]; auto hi = new int[N]; hi[0] = N; for (; ; ) { auto mid = new int[N]; { int carry; foreach (i; 0 .. N) { mid[i] = (lo[i] + hi[i] + carry) / 2; carry = (lo[i] + hi[i] + carry) % 2 * (N - 1 - i); } foreach_reverse (i; 1 .. N) { mid[i - 1] += mid[i] / (N - i); mid[i] %= (N - i); } } if (lo == mid) break; (Ask(toPerm(mid)) ? lo : hi) = mid; } Answer(toPerm(lo)); }