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

template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;

constexpr bool TESTING = false;

using ll = int64_t;

const int N = 2010;

int n;
int a_actual[N];
int id[N], a[N], ok[N][N], f[N][N];

int num_queries = 0;

inline bool qry(int l, int r) {
	assert(1 <= l && l <= r && r <= n);
	if (ok[l][r]) return f[l][r];
	cout << "? " << l << ' ' << r << endl;
	bool cur;
	if constexpr (!TESTING) {
		cin >> cur;
	} else {
		cur = false;
		for (int i = l; i <= r; i++) {
			for (int j = i+1; j <= r; j++) {
				cur ^= (a_actual[i] > a_actual[j]);
			}
		}
	}
	num_queries++;
	f[l][r] = cur;
	ok[l][r] = 1;
	return cur;
}

int ni[N], t[N];

inline int lowbit(int x) { return x & (-x); }

inline void add(int x, int r) {
	for (int i = x; i <= r; i += lowbit(i)) t[i] ^= 1;
}

inline bool sum(int x) {
	bool now = 0;
	for (int i = x; i; i -= lowbit(i)) now ^= t[i];
	return now;
}

inline void build(int r) {
	for (int i = 1; i <= r; i ++) t[i] = 0;
	for (int i = r; i >= 1; i --) { ni[i] = sum(a[i]); add(a[i], r); }
	for (int i = r - 1; i >= 1; i --) ni[i] ^= ni[i + 1];
}

inline bool check(int p, int x) {
	if (id[p] + 1 == x) return !qry(id[p], x);
	int a1 = qry(id[p], x), a2 = qry(id[p] + 1, x), a3 = ni[id[p]], a4 = ni[id[p] + 1];
	//cout << p << ' ' << id[p] << ' ' << x << endl;
	//cout << a1 << a2 << a3 << a4 << endl;
	return !(a1 ^ a2 ^ a3 ^ a4);
}

mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());
int rand_int(int lo, int hi) {
	return uniform_int_distribution<int>(lo, hi)(mt);
}

int main() {
	ios_base::sync_with_stdio(false), cin.tie(nullptr);
	cout << fixed << setprecision(20);

	if constexpr (!TESTING) {
		cin >> n;
	} else {
		n = rand_int(3, 10);
		iota(a_actual + 1, a_actual + n + 1, 1);
		shuffle(a_actual + 1, a_actual + n + 1, mt);
	}

	id[1] = 1;
	a[1] = 1;
	for (int i = 2; i <= n; i ++) {
		int l = 1, r = i - 1, ans = 0;
		while (l <= r) {
			int mid = (l + r) >> 1;
			if (check(mid, i)) { ans = mid; l = mid + 1; }
			else r = mid - 1;
		}
		for (int j = i - 1; j > ans; j --) {
			a[id[j]] = j + 1;
			id[j + 1] = id[j];
		}
		id[ans + 1] = i;
		a[i] = ans + 1;
		build(i);
		//for (int j = 1; j <= n; j ++) cout << ni[j] << ' ';
		//cout << endl;
	} 
	cout << "! ";
	for (int i = 1; i < n; i ++) cout << a[i] << ' ';
	cout << a[n] << endl;
	assert(num_queries <= 40000);

	if constexpr (TESTING) {
		bool works = true;
		for (int i = 1; i <= n; i++) {
			works &= (a[i] == a_actual[i]);
		}
		if (!works) {
			for (int i = 1; i <= n; i++) {
				cerr << a[i] << " \n"[i==n];
			}
			for (int i = 1; i <= n; i++) {
				cerr << a_actual[i] << " \n"[i==n];
			}
			assert(false);
		}
	}

	return 0;
}
/*
1 2 6 4 3 5
2 3 5 4 1 6
*/