#include <bits/stdc++.h>
using namespace std;
bool stB;
namespace SOL {

void debug(const char *msg, ...) {
#ifdef CLESIP
    va_list arg;
    static char pbString[512];
    va_start(arg,msg);
    vsprintf(pbString,msg,arg);
    cerr << "[DEBUG] " << pbString << "\n";
    va_end(arg);
#endif    
}

using u64 = unsigned long long;
using i64 = long long;
template <typename T, typename L> bool chkmax(T &x, L y) { if (x < y) return x = y, true; return false; }
template <typename T, typename L> bool chkmin(T &x, L y) { if (y < x) return x = y, true; return false; }

const int N = 1e3 + 10;
const u64 B = 13331;
int n, a[N], res[N], tot;

namespace SAM {
	struct Node {
		int fa, len;
		map<int, int> nxt;
	} t[N * 2];

	int cnt = 1, lst = 1;
	i64 f[N * 2];

	void clear() {
		for (int i = 1; i <= cnt; i ++) {
			t[i].fa = t[i].len = 0;
			t[i].nxt.clear();
			f[i] = 0;
		}
		cnt = 1, lst = 1;
	}

	void dfs(int x) {
		for (auto [_, y] : t[x].nxt) {
			if (!y)
				continue;
			if (!f[y])
				dfs(y);
			f[x] += f[y];
		}
		f[x] += 1;
	}

	void insert(int ch) {
		int cur = ++ cnt, p = lst;
		t[cnt].len = t[p].len + 1;
		for (; p && !t[p].nxt[ch]; p = t[p].fa)
			t[p].nxt[ch] = cur;
		int q = t[p].nxt[ch];
		if (!q) {
			t[cur].fa = 1;
		} else if (t[q].len + 1 == t[p].len) {
			t[cur].fa = q;
		} else {
			int x = ++ cnt;
			t[x] = t[q];
			t[x].len = t[p].len + 1;
			for (; p && t[p].nxt.find(ch) != t[p].nxt.end()  && t[p].nxt[ch] == q; p = t[p].fa)
				t[p].nxt[ch] = x;
			t[q].fa = t[cur].fa = x;
		}
		lst = cur;
	}
}

i64 count(int l, int r) {
	SAM::clear();
	for (int i = l; i <= r; i ++)
		SAM::insert(a[i]);
	SAM::dfs(1);
	return SAM::f[1] - 1;
}

i64 __count(int l, int r) {
	SAM::clear();
	for (int i = l; i <= r; i ++)
		SAM::insert(res[i]);
	SAM::dfs(1);
	return SAM::f[1] - 1;
}

i64 ask(int l, int r) {
	cout << "? " << l << " " << r << endl;
	static int cnt = 0;
	++ cnt;
#ifdef CLESIP
	// cerr << "time: " << cnt << "\n";
	return __count(l, r);
#else
	i64 k; cin >> k;
	return k;
#endif
}

void ___solve() {
	cin >> n;
#ifdef CLESIP
	for (int i = 1; i <= n; i ++)
		cin >> res[i];
#endif	
	a[1] = ++ tot;
	for (int i = 2; i <= n; i ++) {
		int l = 1, r = i - 1, res = i;
		a[i] = tot + 1;
		while (l <= r) {
			int mid = (l + r) >> 1;
			if (ask(mid, i) == count(mid, i)) {
				r = mid - 1;
				res = mid;
			} else {
				l = mid + 1;
			}
		}
		if (res == 1)
			a[i] = ++ tot;
		else
			a[i] = a[res - 1];
	}
	cout << "!";
	for (int i = 1; i <= n; i ++)
		cout << " " << a[i];
	cout << endl;
}

}
bool edB;
signed main() {
	SOL::___solve();
#ifdef CLESIP
	// cerr << "Memory: " << (&stB - &edB) / 1024.0 / 1024.0 << "MB\n";
	cerr << "Time: " << 1.0 * clock() / CLOCKS_PER_SEC << "s\n";
#endif
	return 0;
}