#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pii pair<int, int>
#define mp make_pair
#define fi first
#define se second 
#define deb(var) cerr << #var << '=' << var << "; "
//#define int long long
int n, a[100010], i, p[20001];
struct BIT {
	int w[2010];
	void add(int p, int x) {
		for (int i = p; i <= 2000; i += i & (-i)) w[i] += x;
	}
	int query(int p) {
		int res = 0;
		for (int i = p; i; i -= i & (-i)) res += w[i];
		return res;
	}
} bit;
int q(int l, int r) {
	if (l >= r) return 0; 
	if (r < i) {
		memset(bit.w, 0, sizeof bit.w);
		int ans = 0;
		for (int j = 1; j <= i; j++) {
			if (a[j] >= l && a[j] <= r) {
				ans += bit.query(2000) - bit.query(a[j]); bit.add(a[j], 1);
			}
		}
		return ans & 1;
	}
	cout << "? " << l << " " << r << endl;
	int x; cin >> x; return x;
}
int cmp(int x, int y) {
	return q(x, y) ^ q(x + 1, y) ^ q(x, y - 1) ^ q(x + 1, y - 1); 
}
signed main() {
	cin >> n;
	i = 1; a[1] = 1;
	for (i = 2; i <= n; i++) {
		int l = 0, r = i - 1;
		a[i] = i;
		while (l < r) {
			int mid = (l + r + 1) >> 1;
			if (!cmp(a[mid], i)) l = mid; else r = mid - 1; 
		}
		for (int j = i; j > l + 1; j--) a[j] = a[j - 1]; a[l + 1] = i;
	}
	for (int i = 1; i <= n; i++) p[a[i]] = i;
	cout << "! ";
	for (int i = 1; i <= n; i++) cout << p[i] << " "; cout << endl;
}