#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define lowbit(i) (i&-i)
const int N = 2077,P = 131;
int n,s[N],cnt,hs[N],bit[N];
map<int,int> endpos[N]; 
int ask(int l,int r){
	cout << "? " << l << ' ' << r << "\n",cout.flush();
	int res;cin >> res;
	return res;
}
void add(int i,int w){
	for(;i<=n;i+=lowbit(i)) bit[i] += w;
}
int qry(int i){
	int res = 0;
	for(;i;i-=lowbit(i)) res = res+bit[i];
	return res; 
}
void upd(int l,int r){
	add(l,1),add(r+1,-1);
}
int main(){
	cin.tie(0),cout.tie(0);
	ios::sync_with_stdio(0); 
	cin >> n;
	for(int i=1;i<=n;i++){
		int l = 1,r = i-1,las = i-1;
		while(l<=r){
			int mid = (l+r)>>1;
			if(qry(mid)+i-mid+1==ask(mid,i)){
				las = mid-1;
				r = mid-1;
			}else{
				l = mid+1;
			}
		}
		if(las == 0) s[i] = ++cnt;
		else s[i] = s[las];
		int now = 0;
		for(int j=i,las,l,r;j>=1;j--){
			now = now*P+s[j]-'a'+1;
			las = endpos[i-j+1][now],l = las+1,r = j;
			upd(l,r);
			endpos[i-j+1][now] = j;
		}
	}
	cout << "! ";
	for(int i=1;i<=n;i++) cout << s[i] << ' ';
	return 0;
}