#include "bits/stdc++.h"
using namespace std;

#define DEBUG 0

using ll = long long;
using pii = pair<int, int>;

int main() {
	int n;
	cin >> n;

	vector<int> p(n + 1);
	if (DEBUG) {
		for (int i = 1; i <= n; i++) {
			cin >> p[i];
		}
	}

	vector<int> v;
	v.push_back(1);

	vector<vector<bool>> lookup_smaller(n + 1, vector<bool>(n + 1));

	auto ask = [&](int x, int y) -> int {
		if (x == y) return 0;
		if (DEBUG) {
			// cout << "$" << x << " " << y << endl;
			int cnt = 0;
			for (int i = x; i <= y; i++) {
				for (int j = i + 1; j <= y; j++) {
					if (p[i] > p[j]) {
						++cnt;
					} 
				}
			}
			return cnt % 2;
		}
		
		static map<pii, int> M;
		auto iter = M.find({x, y});
		if (iter == M.end()) {
			cout << "? " << x << " " << y << endl;
			int ans;
			cin >> ans;
			return M[{x, y}] = ans;
		} 
		else {
			return iter->second;
		}
	};
	
	function<bool(int, int)> smaller = [&](int x, int y) -> bool {
		if (y <= (int) v.size()) {
			return lookup_smaller[x][y];
		}
		bool ret = ask(x + 1, y);
		for (int i = x + 1; i <= y - 1; i++) {
			ret ^= !smaller(x, i);
		}
		ret = ret == ask(x, y);
		// cout << x << " < " << y << " ? " << (ret ? "true" : "false") << endl;
		return ret;
	};

	for (int i = 2; i <= n; i++) {
		int l = 0;
		int r = i - 1;
		while (l < r) {
			int mid = (l + r) / 2;
			if (smaller(v[mid], i)) {
				l = mid + 1;
			}
			else {
				r = mid;
			}
		}
		for (int j = 0; j < l; j++) {
			lookup_smaller[v[j]][i] = 1;
		}
		for (int j = l; j < i - 1; j++) {
			lookup_smaller[i][v[j]] = 1;
		}
		v.insert(begin(v) + l, i);
	}

	// cout << "! ";
	// for (int i = 0; i <= n; i++) {
	// 	cout << v[i] << " \n"[i == n];
	// }

	vector<int> ans(n + 1);
	for (int i = 0; i < n; i++) {
		ans[v[i]] = i + 1;
	}

	cout << "! ";
	for (int i = 1; i <= n; i++) {
		cout << ans[i] << " \n"[i == n];
	}
	cout.flush();
}