#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=1<<30;

int main(){
    
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
    
    int N;cin>>N;
    int can=0;
    can+=floor(log2(N)*(N-1));
    can-=(N-1)/2;
    can++;
    
    vector<int> rem(N);iota(all(rem),1);
    
    vector<int> ans;
    
    for(int t=0;t<N-1;t++){
        int left=0,right=si(rem);
        while(right-left>1){
            int mid=(left+right)/2;
            vector<int> A=ans;
            A.push_back(rem[mid]);
            for(int i=0;i<si(rem);i++){
                if(i!=mid) A.push_back(rem[i]);
            }
            cout<<"?";
            for(int a:A) cout<<" "<<a;
            cout<<endl;
            int x;cin>>x;
            if(x) left=mid;
            else right=mid;
            can--;
            
            if(can==0){
                shuffle(all(rem),rng);
                for(int x:rem){
                    ans.push_back(x);
                }
                
                cout<<"!";
                for(int a:ans) cout<<" "<<a;
                cout<<endl;
                
                return 0;
            }
        }
        ans.push_back(rem[left]);
        rem.erase(rem.begin()+left);
    }
    
    ans.push_back(rem.back());
    
    cout<<"!";
    for(int a:ans) cout<<" "<<a;
    cout<<endl;
}