import sys # sys.setrecursionlimit(1000005) # sys.set_int_max_str_digits(200005) int1 = lambda x: int(x)-1 pDB = lambda *x: print(*x, end="\n", file=sys.stderr) p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr) def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] # dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] # inf = -1-(-1 << 31) inf = -1-(-1 << 63) md = 10**9+7 # md = 998244353 from itertools import permutations # memo={} def ask(q): # if q in memo:return memo print("?", *q, flush=True) res=II() # memo[q]=res return res n=II() a=list(range(1,n+1)) pre=[] while len(a)>8: l,r=0,len(a) while l+1<r: m=(l+r)//2 q=pre+[a[m]]+a[:m]+a[m+1:] if ask(tuple(q)): l=m else: r=m pre.append(a.pop(l)) # print(ans,a) pp=list(permutations(a)) l,r=0,len(pp) while l+1<r: m=(l+r)//2 if ask(pre+list(pp[m])): l=m else: r=m ans=pre+list(pp[l]) print("!",*ans,flush=True)