#include <iostream>
#include <algorithm>

using namespace std;

int main()
{
    long long n, i, maxV=0, v;
    cin>>n;
    long long a[n], maxA[n];
    for (i=0; i<n; i++)
    {
        cin>>a[i];
    }
    sort(a, a+n);
    do
    {
        cout<<"? ";
        for (i=0; i<n; i++)
        {
            cout<<a[i]<<" ";
        }
        cout.flush();
        cin>>v;
        if (v>maxV)
        {
            maxV=v;
            for (i=0; i<n; i++)
            {
                maxA[i]=a[i];
            }
        }
    }while (next_permutation(a, a+n));
    cout<<"! ";
    for (i=0; i<n; i++)
        {
            cout<<maxA[i]<<" ";
        }
        cout.flush();
    return 0;
}