#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pii pair<int, int>
#define piii tuple<int, int, int>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define deb(var) cerr << #var << '=' << (var) << "; "
namespace Loser {
	int n;
	short ans[2010][2010];
	int ask(int l, int r) {
		if (l >= r) return 0;
		if (ans[l][r]) return ans[l][r] - 1;
		cout << "? " << l << ' ' << r << endl;
		int x; cin >> x; ans[l][r] = x + 1; return x;
	}
	int a[2010], pos[2010], rev[2010];
	int cmp(int l, int r) {
		if (l == 0) return 0;
		return rev[l] ^ rev[l + 1] ^ ask(l, r) ^ ask(l + 1, r);
	}
	void main() {
		cin >> n;
		pos[1] = a[1] = 1;
		for (int i = 2; i <= n; i++) {
			int l = 0, r = i - 1;
			while (l < r) {
				int mid = (l + r + 1) >> 1;
				if (cmp(pos[mid], i)) r = mid - 1; else l = mid;
			}
			for (int k = i; k > l + 1; k--) pos[k] = pos[k - 1]; pos[l + 1] = i;
			for (int k = 1; k <= i; k++) a[pos[k]] = k;
			for (int k = i, s = 0; k >= 1; k--) s ^= a[k] > a[i], rev[k] ^= s;
		}
		cout << "! "; 
		for (int i = 1; i <= n; i++) cout << a[i] << ' '; cout << endl;
	}
}
signed main() {
	int T = 1; while (T--) Loser::main(); return 0;
}