#include<bits/stdc++.h>
using namespace std;
#define max_n 400
int n;
int p[max_n+2];
bool can[max_n+2][max_n+2];
int now;
struct E{int v,nx;}e[max_n*2+2];
int ei=0,fir[max_n+2];
int de[max_n+2];
vector<int>ans;
inline void addedge(int u,int v){e[++ei]=(E){v,fir[u]}; fir[u]=ei; ++de[u];}
void dfs(int u,int f){
	ans.push_back(u);
	for(int i=fir[u],v;i;i=e[i].nx){
		v=e[i].v;
		if(v!=f)dfs(v,u);
	}
}
int main(){
	srand(time(0));
	scanf("%d",&n);
	for(int i=1;i<=n;++i)p[i]=i;
	memset(can,1,sizeof(can));
	now=n*(n-1)/2;
	while(now>n-1){
		random_shuffle(p+1,p+n+1);
		printf("? ");
		for(int i=1;i<=n;++i)printf("%d ",p[i]);
		printf("\n"); fflush(stdout);
		int x; scanf("%d",&x);
		if(!x){
			for(int i=1;i<n;++i){
				if(can[p[i]][p[i+1]]){can[p[i]][p[i+1]]=can[p[i+1]][p[i]]=false; --now;}
			}
		}
	}
	for(int i=1;i<=n;++i){
		for(int j=i+1;j<=n;++j){
			if(can[i][j]){addedge(i,j); addedge(j,i);}
		}
	}
	for(int u=1;u<=n;++u){
		if(de[u]==1){dfs(u,0); break;}
	}
	printf("! ");
	for(auto u:ans)printf("%d ",u);
	printf("\n");
	return 0;
}