#include <stdio.h>
#include <string.h>

#include <random>
#include <chrono>
#include <algorithm>

#define LOG(FMT...) fprintf(stderr, FMT)

using namespace std;

typedef long long LL;
constexpr int N = 2005;

mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

int n;
int a[N], b[N];
int cur;
bool f[N][N];

bool Q(int x) {
	int s, t;
	printf("? %d %d\n", x, cur);
	fflush(stdout);
	scanf("%d", &s);
	if (x == cur - 1) {
		return s;
	}
	printf("? %d %d\n", x + 1, cur);
	fflush(stdout);
	scanf("%d", &t);
	s ^= t;
	return s ^ f[x][cur - 1] ^ f[x + 1][cur - 1];
}

int main() {
	scanf("%d", &n);
	b[1] = 1;
	for (cur = 2; cur <= n; ++cur) {
		int l = 1, r = cur, md;
		while (l < r) {
			int md = l + r >> 1;
			if (Q(b[md])) {
				r = md;
			} else {
				l = md + 1;
			}
		}
		for (int j = cur; j > r; --j) {
			b[j] = b[j - 1];
		}
		b[r] = cur;
		for (int i = 1; i <= cur; ++i) {
			a[b[i]] = i;
		}
		f[cur - 1][cur] = (a[cur - 1] > cur);
		for (int x = cur - 2; x; --x) {
			f[x][cur] = (a[x] > a[cur]) ^ f[x + 1][cur] ^ f[x][cur - 1] ^ f[x + 1][cur - 1];
		}
	}
	printf("!");
	for (int i = 1; i <= n; ++i) {
		printf(" %d", a[i]);
	}
	puts("");
	fflush(stdout);
	return 0;
}