#include <algorithm>
#include <cstdio>
using i32 = int;
constexpr i32 N = 1000;
i32 aks(i32 l, i32 r) noexcept {
	static i32 x;
	printf("? %d %d\n", l, r), fflush(stdout);
	return scanf("%d", &x), x;
}
i32 n, ans[N + 1], cur;
i32 suf[N + 1], vis[N + 1], pos[N + 1];
i32 cpy[N + 1], nxt[N + 1];
signed main() noexcept {
	scanf("%d", &n);
	for (i32 i = 1; i <= n; ++i) {
		i32 l = 0, r = i - 1;
		for (i32 mid; l < r;)
			if (mid = (l + r + 1) >> 1, aks(mid, i) - suf[mid] <= i - mid)
				l = mid;
			else
				r = mid - 1;
		ans[i] = l ? ans[l] : ++cur;
		// std::reverse_copy(ans + 1, ans + i + 1, cpy + 1);
		std::copy(ans + 1, ans + i + 1, cpy + 1);
		std::reverse(cpy + 1, cpy + i + 1);
		nxt[1] = 0;
		for (i32 k = 2, j = 0; k <= i; ++k) {
			while (j && cpy[j + 1] != cpy[k]) j = nxt[j];
			cpy[j + 1] == cpy[k] && ++j, nxt[k] = j;
		}
		std::fill(pos + 1, pos + i + 1, 1), std::fill(vis + 2, vis + i + 1, 0), vis[0] = 1;
		for (i32 k = 1; k <= i; ++k)
			if (!vis[nxt[k]]) vis[nxt[k]] = 1, --pos[k];
		for (i32 k = 1; k <= i; ++k) pos[k] += pos[k - 1], suf[i - k + 1] += pos[k];
	}
	putchar('!');
	for (i32 i = 1; i <= n; ++i) printf(" %d", ans[i]);
	return 0;
}