#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <unordered_map>
#define mems(x, v) memset(x, v, sizeof x)
#define mcpy(x, y) memcpy(x, y, sizeof x)
using namespace std;
typedef pair <int, int> pii;
typedef long long ll;
typedef unsigned long long ull;
typedef long double wisdom;

unordered_map <ull, int> lst;
int ans[1005], tot[1005], cf[1005]; //tot[]: 区间内本质不同子串个数

inline void add(int l, int r) {cf[l]++, cf[r + 1]--;}
inline int ask(int l, int r) {cout << "? " << l << ' ' << r << endl; int x; cin >> x; return x;}
int FIND(int l, int r) {
	int R = r;
	while (l < r) {int mid = (l + r) >> 1; (tot[mid] + (R - mid + 1) == ask(mid, R)) ? (r = mid) : (l = mid + 1);}
	return r;
}
int main() {
	ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
	int n, idx; cin >> n, tot[1] = lst[ans[1] = idx = 1] = 1;
	for (int i = 2; i <= n; i++) {
		ull x = 0; int p = FIND(1, i);
		ans[i] = (p == 1 ? ++idx : ans[p - 1]);
		for (int j = 1; j <= i; j++) cf[j] = 0;

		for (int j = i; j; j--) x = x * 7113846 + ans[j], add(lst[x] + 1, j), lst[x] = j;
		for (int j = 1; j <= i; j++) cf[j] += cf[j - 1]; for (int j = 1; j <= i; j++) tot[j] += cf[j];
	}
	cout << "! "; for (int i = 1; i <= n; i++) cout << ans[i] << ' '; cout << endl;
	return 0;
}