#include <bits/stdc++.h>
using namespace std;

random_device rnd;
mt19937 mt(rnd());

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int N; cin >> N;
    int query = 12000;
    auto ask = [&](vector<int> A) -> int {
        query--;
        assert(query >= 0);
        cout << "?";
        for(auto a : A) cout << " " << a; cout << endl;
        int ret; cin >> ret;
        if(ret == -1) assert(false);
        return ret;
    };
    auto ans = [&](vector<int> P) -> void {
        cout << "!";
        for(auto a : P) cout << " " << a+1; cout << endl;
        exit(0);
    };

    auto check = [&](vector<int> &A,int L,int M,int R) -> vector<int> {
        vector<int> ret;
        int pos = L,pos2 = M;
        while(pos != M && pos2 != R){
            vector<int> B(N,2);
            int p1 = A.at(pos),p2 = A.at(pos2);
            B.at(p1) = 0,B.at(p2) = 1;
            if(ask(B) == 3) ret.push_back(p1),pos++;
            else ret.push_back(p2),pos2++;
        }
        while(pos != M) ret.push_back(A.at(pos++));
        while(pos2 != R) ret.push_back(A.at(pos2++));
        return ret;
    };
    auto merge = [&](auto merge,vector<int> &A,int L = -1,int R = -1) -> void {
        if(L == -1 && R == -1) L = 0,R = A.size();
        if(R-L <= 1) return;
        int M = (L+R)/2;
        merge(merge,A,L,M); merge(merge,A,M,R);
        vector<int> Ls,Rs;
        for(int i=L; i<M; i++) Ls.push_back(A.at(i));
        for(int i=M; i<R; i++) Rs.push_back(A.at(i));
        
        auto C = check(A,L,M,R);
        for(int i=L; i<R; i++) A.at(i) = C.at(i-L);
    };

    vector<int> P(N),X(N,1);
    for(int i=0; i<N; i++) P.at(i) = i;
    //shuffle(P.begin(),P.end(),mt);
    for(int i=0; i<N; i++){
        X.at(P.at(i)) = 0;
        if(ask(X) == 1){swap(P.at(i),P.back()); break;}
        X.at(P.at(i)) = 1;
    }

    merge(merge,P,0,N-1);
    ans(P);
}