import sys

input=sys.stdin.readline

def solv():
    n = int(input())
    N = [int(s) for s in input().split()]
    if n==1:
        print('!',*N)
        sys.stdout.flush()
        return
    N.sort()
    NN=N[:]
    if N[0]==N[-1]:
        print('!',*N)
        sys.stdout.flush()
        return
    A=[0]*n
    print('?',*N)
    sys.stdout.flush()
    ans = int(input())
    N[0],N[-1]=N[-1],N[0]
    M=N[:]
    print('?',*N)
    sys.stdout.flush()
    newans = int(input())
    A[0]=(ans-newans)//(N[-1]-N[0])
    done=2
    i=0
    last=newans
    while done<n and N[i] != N[i+1]:
        N[i],N[i+1]=N[i+1],N[i]
        print('?',*N)
        sys.stdout.flush()
        new = int(input())
        A[i+1]=A[i]-(last-new)//(N[i+1]-N[i])
        done+=1
        i+=1
        last=new
    i=n-1
    last=newans
    while done<n and M[i] != M[i-1]:
        M[i],M[i-1]=M[i-1],M[i]
        print('?',*M)
        sys.stdout.flush()
        new = int(input())
        A[i-1]=A[i]-(last-new)//(N[i-1]-N[i])
        done+=1
        i-=1
        last=new
    #print(A)
    # NN sorted
    AA=[(A[i],i) for i in range(n)]
    AA.sort()
    for i in range(n):
        N[AA[i][1]]=NN[i]
    print('!',*N)
    sys.stdout.flush()
    return

solv()
exit()