def ask():
    print("? " + " ".join(map(str,lst)))
    sys.stdout.flush()
    res = get() if DEBUG else input()
    return res.split()

def get():
    def f(x): return "<" if x==1 else ">" if x==-1 else "="
    #print(lst)
    res = [0]*n
    for i in range(n):
        v,w = order.index(lst[2*i]), order.index(lst[2*i+1])
        if v < w: res[i] = 1
        elif v==w: res[i] = 0
        elif v > w: res[i] = -1
    ans = " ".join(map(f,res))
    print(ans)
    return ans

import sys
n = int(input())
p = n%2
lst = [1-p,2-p]
for i in range((n+1)//2-1):
    lst += [3+i-p,n-i]
lst += [0]*(n-p)
assert len(lst) == 2*n
DEBUG = 0
order = list(range(1,n+1))
from random import shuffle
shuffle(order)
order.insert(0,0)

g = [[-5]*n for _ in range(n)]
for i in range(n+p):
    s = ask()
    # 行列に記録
    for i in range((n+p)//2):
        v,w = lst[2*i]-1,lst[2*i+1]-1
        if v==-1 or w==-1: continue
        if s[i] != "=":
            g[v][w] = 1 if s[i] == ">" else -1
            g[w][v] = 1 if s[i] == "<" else -1
        else:
            g[v][w] = g[w][v] = 1
    # サイクリックに移動        
    for j in range(1,n+p):
        lst[j] += 1
        if lst[j] > n: lst[j] = 2-p

#print(g)
ans = list(range(n))[::-1]
for i in range(n):
    for j in range(n-1-i):
        if g[ans[j]][ans[j+1]] == 1:
            ans[j],ans[j+1] = ans[j+1],ans[j]
for i in range(n): ans[i] += 1
#print(order)
print("! " + " ".join(map(str,ans)))