n = int(input())
fact = [1] * (n + 1)
for i in range(1, n + 1):
  fact[i] = fact[i - 1] * i
tv = 0
fv = fact[n]
while fv - tv > 1:
  mid = (tv + fv) // 2
  used = [0] * n
  P = []
  x = mid
  for i in range(n):
    idx = x // fact[n - 1 - i]
    cnt = 0
    for j in range(n):
      if used[j] == 0:
        if cnt == idx:
          P.append(j + 1)
          used[j] = 1
          break
        cnt += 1
    x %= fact[n - 1 - i]
  print("?", end=" ")
  s = [str(p) for p in P]
  print(" ".join(s))
  ret = int(input())
  if ret == 1:
    tv = mid
  else:
    fv = mid

used = [0] * n
P = []
x = tv
for i in range(n):
  idx = x // fact[n - 1 - i]
  cnt = 0
  for j in range(n):
    if used[j] == 0:
      if cnt == idx:
        P.append(j + 1)
        used[j] = 1
        break
      cnt += 1
  x %= fact[n - 1 - i]
print("!", end=" ")
s = [str(p) for p in P]
print(" ".join(s))