// what is matter? never mind. 
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
#define ull unsigned long long
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 200005
#define inf 0x3f3f3f3f

int n,p[maxn];
mt19937_64 rnd(114514);

bool e[405][405];
int deg[405];

void dfs(int u,int pa){
	cout<<u<<" ";
	For(v,1,n)
		if(v!=pa && e[u][v])dfs(v,u);
}

signed main()
{
	cin>>n;
	For(i,1,n)p[i]=i;
	For(i,1,n)deg[i]=n-1;
	memset(e,1,sizeof e);
	For(_,1,25000){
		shuffle(p+1,p+n+1,rnd);
		cout<<"? ";
		For(i,1,n)cout<<p[i]<<" ";cout<<endl;
		int x;cin>>x;
		if(x==n-1){
			cout<<"! ";
			For(i,1,n)cout<<p[i]<<" ";cout<<endl;
			exit(0);
		}
		if(x==0){
			For(i,1,n-1)
				if(e[p[i]][p[i+1]])
					e[p[i]][p[i+1]]=e[p[i+1]][p[i]]=0,--deg[p[i]],--deg[p[i+1]];
			bool ok=1;
			For(i,1,n)
				if(deg[i]>2){ok=0;break;}
			if(ok){
				cout<<"! ";
				For(i,1,n)if(deg[i]==1)dfs(i,0);
				cout<<endl;
				exit(0);
			}
		}
	}
	return 0;
}