#include<bits/stdc++.h>
#define il inline
#define ui unsigned int
#define ll long long
#define ull unsigned ll
#define lll __int128
#define db double
#define ldb long double
#define pii pair<int,int>
#define vi vector<int>
#define vpii vector<pii>
#define fir first
#define sec second
#define gc getchar
#define pc putchar
#define mst(a,x) memset(a,x,sizeof a)
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define pct __builtin_popcount
using namespace std;
const int N=1010,INF=0x3f3f3f3f,MOD=1e9+7; const ll INFll=0x3f3f3f3f3f3f3f3f;
il int rd() {int x=0,f=1; char ch=gc(); while(ch<'0'||ch>'9') {if(ch=='-') f=-1; ch=gc();} while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=gc(); return x*f;}
il ll rdll() {ll x=0; int f=1; char ch=gc(); while(ch<'0'||ch>'9') {if(ch=='-') f=-1; ch=gc();} while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=gc(); return x*f;}
il void wr(int x) {if(x<-2147483647) {printf("-2147483648"); return;} if(x<0) {pc('-'),wr(-x); return;} if(x<10) {pc(x+'0'); return;} wr(x/10),pc(x%10+'0');}
il void wrll(ll x) {if(x<-9223372036854775807) return (void)printf("-9223372036854775808"); if(x<0) return pc('-'),wrll(-x); if(x<10) return (void)pc(x+'0'); wrll(x/10),pc(x%10+'0');}
il void wr(int x,char *s) {wr(x),printf("%s",s);}
il void wrll(ll x,char *s) {wrll(x),printf("%s",s);}
il int vmod(int x) {return x>=MOD?x-MOD:x;}
il int vadd(int x,int y) {return vmod(x+y);}
il int vsub(int x,int y) {return vmod(x-y+MOD);}
il int vmul(int x,int y) {return 1ll*x*y%MOD;}
il int qpow(int x,int y) {int res=1; for(;y;y>>=1,x=vmul(x,x)) if(y&1) res=vmul(res,x); return res;}
il void cadd(int &x,int y) {x=vmod(x+y);}
il void csub(int &x,int y) {x=vmod(x-y+MOD);}
il void cmax(int &x,int y) {x<y&&(x=y);}
il void cmin(int &x,int y) {x>y&&(x=y);}
int n,cnt,a[N],b[N],ne[N][N];
int qry(int l,int r) {printf("? "),wr(l," "),wr(r,"\n"),fflush(stdout); return rd();}
void QwQ() {
	n=rd(),cnt=a[1]=b[1]=1;
	for(int i=2,l,r,mid,mx;i<=n;i++) {
		for(l=1,r=i-1;l<=r;) mid=l+r>>1,qry(mid,i)==b[mid]+i+1-mid?r=mid-1:l=mid+1;
		mx=0,a[i]=!r?++cnt:a[r],b[i]=1;
		for(int j=i-1,k;j;j--) {
			k=ne[j][i-1]; while(k&&a[i]!=a[j+k]) k=ne[j][j+k-1];
			if(a[i]==a[j]||k) ne[j][i]=k+1; b[j]+=i+1-(mx=max(mx,ne[j][i]))-j;
		}
	}
	printf("! "); for(int i=1;i<=n;i++) wr(a[i]," "); puts(""),fflush(stdout);
}
signed main() {
	int T=1; while(T--) QwQ();
}