import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.range, 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; }
real readReal() { return readToken().to!real; }

void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


int N;

void main() {
  N = readInt();
  auto a = iota(1, N + 1).array;
  foreach (h; 0 .. N * 2) {
    auto query = new int[N * 2];
    query[h % 2 .. h % 2 + N] = a[];
    writeln("? ", query.to!string.replaceAll(regex(`[\[\],]`), ""));
    stdout.flush;
    auto result = new string[N];
    foreach (i; 0 .. N) {
      result[i] = readToken();
    }
    foreach (i; 0 .. N) {
      if (query[i * 2] != 0 && query[i * 2 + 1] != 0) {
        switch (result[i]) {
          case "<": break;
          case ">": swap(a[i * 2 - h % 2], a[i * 2 + 1 - h % 2]); break;
          case "=": assert(false);
          default: assert(false);
        }
      }
    }
  }
  writeln("! ", a.to!string.replaceAll(regex(`[\[\],]`), ""));
}