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

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

int main() {
	int n;
	cin >> n;
	vector<int> v;
	v.push_back(1);

	auto ask = [](int x, int y) -> int {
		if (x == y) return 0;
		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;
		}
	};

	auto smaller = [&](int x, int y) {
		return (ask(x + 1, y) == ask(x, y));
	};

	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;
			}
		}
		v.insert(begin(v) + l, i);
	}

	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];
	}
}