#include<bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pf push_front
#define LC k<<1
#define RC k<<1|1
#define IO cin.sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define rep(i,a,n) for (int i = a; i < n; i++)
#define repn(i,a,n) for (int i = a; i <= n; i++)
#define per(i,a,n) for (int i = (n) - 1; i >= a; i--)
#define pern(i,a,n) for (int i = n; i >= a; i--)

typedef long long LL;
typedef long double LD;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<int, LL> PIL;
typedef pair<LL, int> PLI;
typedef pair<double, double> PDD;
typedef pair<ull, ull> PUU;
typedef pair<LL, LL> PLL;

const int N = 2100;
const int M = 1100000;
const int mod = 1e9+7;
const int inf = (int)1e9;
const LL INF = 1e18;
const double eps = 1e-9;

mt19937_64 Rand((unsigned long long)new char);
#define rand Rand

int n, pos[N], a[N], f[N][N];
int get(int l, int r) {
	int res = 0, x;
	cout << "? " << l << " " << r << endl;
	fflush(stdout);
	cin >> x, res ^= x;
	if (l + 1 == r) return res;
	res ^= f[l][r - 1];
	cout << "? " << l + 1 << " " << r << endl;
	fflush(stdout);
	cin >> x, res ^= x;
	if (l + 2 == r) return res;
	res ^= f[l + 1][r - 1];
	return res;
}	
int main() {
	IO;
	cin >> n;
	pos[1] = 1;
	a[1] = 1;
	repn(i, 2, n) {
		int l = 1, r = i - 1, ans = 0;
		while (l <= r) {
			int mid = (l + r) / 2;
			if (!get(pos[mid], i)) l = mid + 1, ans = mid;
			else r = mid - 1;
		}
		repn(j, 1, i - 1) if (a[j] > ans) a[j]++;
		a[i] = ans + 1;
		repn(j, 1, i) pos[a[i]] = i;
		int tmp = 0;
		pern(j, 1, i - 1) {
			tmp ^= (f[i] < f[j]);
			f[j][i] = f[j][i - 1] ^ tmp;
		}
	}
	cout << "!";
	repn(i, 1, n) cout << " " << a[i];
	cout << endl;
	fflush(stdout);
	return 0;
}