#include<cstdio>
#include<vector>
#include<queue>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<ctime>
#include<random>
#include<array>
#include<map>
#include<assert.h>
#define pb emplace_back
#define mp make_pair
#define fi first
#define se second
#define dbg(x) cerr<<"In Line "<< __LINE__<<" the "<<#x<<" = "<<x<<'\n'
#define dpi(x,y) cerr<<"In Line "<<__LINE__<<" the "<<#x<<" = "<<x<<" ; "<<"the "<<#y<<" = "<<y<<'\n'
#define DE(fmt,...) fprintf(stderr, "Line %d : " fmt "\n",__LINE__,##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int>pii;
typedef pair<ll,int>pli;
typedef pair<ll,ll>pll;
typedef pair<int,ll>pil;
typedef vector<int>vi;
typedef vector<ll>vll;
typedef vector<pii>vpii;
typedef vector<pll>vpll;
template<typename T>T cmax(T &x, T y){return x=x>y?x:y;}
template<typename T>T cmin(T &x, T y){return x=x<y?x:y;}
template<typename T>
T &read(T &r){
	r=0;bool w=0;char ch=getchar();
	while(ch<'0'||ch>'9')w=ch=='-'?1:0,ch=getchar();
	while(ch>='0'&&ch<='9')r=r*10+(ch^48),ch=getchar();
	return r=w?-r:r;
}
template<typename T1,typename... T2>
void read(T1 &x,T2& ...y){read(x);read(y...);}
const int mod=998244353;
inline void cadd(int &x,int y){x=(x+y>=mod)?(x+y-mod):(x+y);}
inline void cdel(int &x,int y){x=(x-y<0)?(x-y+mod):(x-y);}
inline int add(int x,int y){return (x+y>=mod)?(x+y-mod):(x+y);}
inline int del(int x,int y){return (x-y<0)?(x-y+mod):(x-y);}
int qpow(int x,int y){
	int s=1;
	while(y){
		if(y&1)s=1ll*s*x%mod;
		x=1ll*x*x%mod;
		y>>=1;
	}
	return s;
}
#define flh fflush(stdout)
const int N=1010;
int n;
int fa[N],a[N],tot;
int getfa(int x){return fa[x]==x?x:fa[x]=getfa(fa[x]);}
map<int,int>vis[N];
int query(int l,int r){
	if(vis[l].count(r))return vis[l][r];
	cout<<"? "<<l<<' '<<r<<'\n';
	flh;int x;read(x);vis[l][r]=x;
	return x;
}
const ull base1=13331;
const ull base2=19260817;
const ull mod2=998244353;
int c[N],suf[N];
map<pair<ull,ull>,int>pos;
signed main(){
	#ifdef do_while_true
//		assert(freopen("data.in","r",stdin));
//		assert(freopen("1.out","w",stdout));
	#endif
	read(n);
	for(int i=1;i<=n;i++)fa[i]=i;
	c[1]=suf[1]=1;
	pos[mp(1,1)]=1;
	for(int i=2;i<=n;i++){
		int l=1,r=i-1,mid,as=-1;
		while(l<=r){
			mid=(l+r)>>1;
			if(query(mid,i)-suf[mid]==i-mid+1)r=mid-1;
			else l=mid+1,as=mid;
		}
		if(as!=-1){
			fa[getfa(i)]=getfa(as);
		}
		ull u=0,v=0;
		for(int j=i;j>=1;j--){
			u=u*base1+getfa(j);
			v=(v*base2%mod2+getfa(j))%mod2;
			if(pos.count(mp(u,v)))
				c[pos[mp(u,v)]]--;
			c[j]++;
			pos[mp(u,v)]=j;
		}
		for(int j=i;j>=1;j--)suf[j]=suf[j+1]+c[j];
	}
	int tot=0;
	for(int i=1;i<=n;i++)if(getfa(i)==i)a[i]=++tot;
	for(int i=1;i<=n;i++)a[i]=a[getfa(i)];
	cout<<"! ";
	for(int i=1;i<=n;i++)cout<<a[i]<<' ';
//	while(1);
    #ifdef do_while_true
//		cerr<<'\n'<<"Time:"<<1.0*clock()/CLOCKS_PER_SEC*1000<<" ms"<<'\n';
	#endif
	return 0;
}