#include <bits/stdc++.h>
#define N 2009
using namespace std;
int ans2[N][N];

bool query(int l, int r) {
	if (l == r)
		return 0;
	if (ans2[l][r] != -1)
		return ans2[l][r];
	cout << "? " << l << " " << r << endl;
	cin >> ans2[l][r];
	return ans2[l][r];
}
int n;
int par[N], a[N], ra[N];

int main() {
	fill(ans2[0], ans2[0] + N * N, -1);
	cin >> n;
	a[1] = 1;
	ra[1] = 1;
	for (int i = 2; i <= n; i++) {
		int l = 1, r = i;
		while (l < r) {

			int mid = (l + r ) >> 1;
			//cout << l << " " << r << " " << mid << endl;
			int tmp1 = query(ra[mid], i)^par[ra[mid]];
			int tmp2 = query(ra[mid] + 1, i)^par[ra[mid] + 1];
			if (tmp1 == tmp2)
				l = mid + 1;
			else
				r = mid;
		}
		for (int j = 1; j < i; j++)
			if (a[j] >= l)
				a[j]++, ra[a[j]] = j;
		a[i] = l;
		ra[l] = i;
	}
	cout << "! ";
	for (int i = 1; i <= n; i++)
		cout << a[i] << " ";
	cout << endl;
	return 0;
}