#include "bits/stdc++.h"
#define rep(i,a,n) for(auto i=a;i<=n;i++)
#define per(i,a,n) for(auto i=n;i>=a;i--)
#define pb push_back
#define mp make_pair
#define FI first
#define SE second
#define all(A) A.begin(),A.end()
#define sz(A) (int)A.size()
template<class T> bool chmax(T &a, const T &b) {if(a<b) {a=b; return 1;} return 0;}
template<class T> bool chmin(T &a, const T &b) {if(b<a) {a=b; return 1;} return 0;}
using namespace std;

string to_string(const string& s) {return '"' + s + '"';}
string to_string(const char* s) {return to_string((string) s);}
template<typename A, typename B> string to_string(pair<A, B> p) {return "(" + to_string(p.FI) + ", " + to_string(p.SE) + ")";}
template<typename A> string to_string(A v) 
{
    bool first = 1;
    string res = "{";
    for(const auto &x: v) 
    {
        if (!first) res += ", ";
        first = 0;
        res += to_string(x);
    }
    res += "}";
    return res;
}

void debug_out() {cerr << endl;} 
template<typename Head, typename... Tail> void debug_out(Head H, Tail... T) 
{
    cerr << " " << to_string(H);
    debug_out(T...);
}
#ifndef ONLINE_JUDGE
    #define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
    #define debug(...) if(0) puts("No effect.")
#endif

using ll = long long;
//using LL = __int128;
using pii = pair<int,int>;
using vi = vector<int>;
using db = double;
using ldb = long double;

const int maxn = 60000;
const int mod = 998244353;
const int inf = 0x3f3f3f3f;

int v[maxn+5];

using si = set<int>;
int ask(si S)
{
    assert(sz(S)==3);
    printf("? 1");
    for(auto x: S) printf(" %d",x);
    puts("");
    fflush(stdout);
    int x; scanf("%d",&x);
    return x;
}
int smaller(int i,int j)
{
    printf("? 2 %d %d\n",i,j); fflush(stdout);
    int x; scanf("%d",&x);
    return x;
}
void output(int n)
{
    printf("!");
    rep(i,1,n) printf(" %d",v[i]);
    puts("");
    fflush(stdout);
}

si common(si a,si b)
{
    set<int> res;
    for(auto x: a) if(b.count(x)) res.insert(x);
    return res;
}

int main()
{
    int n; scanf("%d",&n);
    si A[4] = {};
    int tmp[4] = {};
    A[0] = si{1,2,3};
    A[1] = si{1,2,4};
    A[2] = si{1,3,4};
    A[3] = si{2,3,4};
    rep(i,0,2) tmp[i] = ask(A[i]), tmp[3] ^= tmp[i];
    int mx = -inf, mn = inf;
    rep(i,0,3) chmax(mx,tmp[i]), chmin(mn,tmp[i]);
    vector<si> sm,bg;
    rep(i,0,3) if(tmp[i]==mn) sm.pb(A[i]); else bg.pb(A[i]);
    assert(sz(sm)==2 && sz(bg)==2);
    auto S = common(sm[0],sm[1]);
    auto B = common(bg[0],bg[1]);
    rep(i,5,n)
    {
        assert(sz(S)==2);
        assert(sz(B)==2);
        int a = *S.begin(), b = *S.rbegin();
        int c = *B.begin(), d = *B.rbegin();
        int z = ask(si{a,c,i});
        // res can be mn/mx/new value (say z).
        if(z==mn)
        {
            // this means that v[i] < mn and v[a] = mn;
            v[a] = mn;
            mn = ask(si{a,b,i});
            S.erase(a);
            S.insert(i);
        } 
        else if(z==mx)
        {
            // this means that v[i] > mx and v[c] = mx;
            v[c] = mx;
            mx = ask(si{c,d,i});
            B.erase(c);
            B.insert(i);
        }
        else
        {
            // z can be in: (mn,mx) / (-inf,mn) / (mx,inf);
            if(mn<z && z<mx)
            {
                v[i] = z;
            }
            else if(z<mn)
            {
                // this means that v[b] = mn and replace mn = z.
                v[b] = mn;
                mn = z;
                S.erase(b);
                S.insert(i);
            }
            else 
            {
                // this means that v[d] = mx and replace mx = z.
                v[d] = mx;
                mx = z;
                B.erase(d);
                B.insert(i);
            }
        }
    }
    int a = *S.begin(), b = *S.rbegin();
    int c = *B.begin(), d = *B.rbegin();
    if(smaller(a,b)==a) v[a] = 1, v[b] = 2;
    else v[a] = 2, v[b] = 1;
    if(smaller(c,d)==c) v[c] = n-1, v[d] = n;
    else v[c] = n, v[d] = n-1;
    output(n);
    return 0;
}
// ! 3 5 4 1 2