#include <bits/stdc++.h>

#define x first
#define y second
#define el '\n'
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = 2010;

int n;
vector<int> a, p;
vector<int> tau[N];
map<pii, int> mp;

int query(int l, int r) {
	if (l == r) return 0;
	if (mp.count({l, r})) return mp[{l, r}];
	cout << "? " << l << ' ' << r << endl;
	int res;
	cin >> res;
	return mp[{l, r}] = res;
}

int main() {
	cin >> n;
	a.resize(n + 1), p.resize(n + 1);
	for (int i = 0; i <= n; ++i) tau[i].resize(n + 1);
	a[1] = p[1] = 1;
	for (int i = 2; i <= n; ++i) {

		auto check = [&](int mid)->bool {
			// cout << mid << el;
			int x = p[mid];
			if (x == i - 1) 
				return query(x, i);
			int tauall = query(x, i);
			int taur = query(x + 1, i);
			int taul = tau[x][i - 1];
			int taumid = tau[x + 1][i - 1];
			// cout << tauall << ' ' << taur << ' ' << taul << ' ' << taumid << el;
			return tauall - taur - taul + taumid & 1;
		};

		int l = 0, r = i - 1, mid;
		while (l < r) {
			mid = l + r + 1 >> 1;
			if (check(mid)) r = mid - 1;
			else l = mid;
		}
		a[i] = l + 1;
		for (int j = 1; j < i; ++j) 
			if (a[j] >= l + 1) ++a[j];
		for (int j = 1; j <= i; ++j) 
			p[a[j]] = j;
		// for (int j = 1; j <= n; ++j) cout << a[j] << ' '; cout << el;

		for (int j = i - 1, inv = 0; j >= 0; --j) {
			if (a[j] > a[i]) ++inv;
			tau[j][i] = tau[j][i - 1] + inv;
		}
	}
	cout << '!';
	for (int i = 1; i <= n; ++i) cout << ' ' << a[i];
	cout << endl;
}