#include <bits/stdc++.h>
using namespace std;

int n, a[2005], rv[2005], bk[2005], chc[2005][2005];

int qry(int l, int r) {
	if (l >= r) {
		return 0;
	}
	if (chc[l][r] != -1) {
		return chc[l][r];
	}
	bool ret;
	cout << "? " << l << ' ' << r << endl;
	cin >> ret;
	return chc[l][r] = ret;
}

int main() {
	memset(chc, -1, sizeof chc);
	a[1] = 1;
	rv[1] = 1;
	cin >> n;
	for (int i = 2; i <= n; i++) {
		int lo = 1, hi = i - 1, val = i;
		while (lo <= hi) {
			int mid = (lo + hi) / 2, pos = rv[mid];
			// [pos, i]
			int x = qry(pos + 1, i);
			int y = qry(pos, i);
			bool cur = y ^ x ^ bk[pos] ^ bk[pos + 1];
			if (cur) {
				// mid > a[i]
				val = mid;
				hi = mid - 1;
			} else {
				lo = mid + 1;
			}
		}
		for (int j = 1; j < i; j++) {
			if (a[j] >= val) {
				a[j]++;
			}
			rv[a[j]] = j;
		}
		a[i] = val;
		rv[val] = i;
		for (int j = i - 1, sf = 0; j >= 1; j--) {
			if (a[j] > a[i]) {
				sf ^= 1;
			}
			bk[j] ^= sf;
		}
	}
	cout << "! ";
	for (int i = 1; i <= n; i++) {
		cout << a[i] << ' ';
	}
	cout << endl;
}