#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
// using mint = modint998244353;
// const int mod = 998244353;
// const int INF = 1e9;
// const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A& a, const B& b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A& a, const B& b) { if (a > b) { a = b; return true; } return false; }
int op(int l, int r) { return l + r; }
int e() { return 0; }
int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n; cin >> n;
	int pre = 0;
	vector<int>a(n);
	rep2(i, 1, n) {
		cout << "? " << 1 << " " << i + 1 << endl;
		int x; cin >> x;
		int d = x - pre;
		pre = x;
		int y = i - d;
		a[i] = y;
	}
	//for (auto e : a) {
	//	cout << e << " ";
	//}cout << endl;
	segtree<int, op, e>seg(vector<int>(n, 1));
	vector<int>b(n);
	rrep(i, n) {
		int idx = seg.max_right(0, [&](int s) { return s <= a[i]; });
		b[i] = idx;
		seg.set(idx, 0);
	}
	cout << "! ";
	for (auto e : b) {
		cout << e + 1 << " ";
	}cout << endl;
	return 0;
}