#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint998244353;
//const int mod = 998244353;
//using mint = modint1000000007;
//const int mod = 1000000007;
//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 local(int u, int v) {
	vector<int>a = { 5,1,3,2,4 };
	vector<int>b = { 4,2,1,3,5 };
	return lcm(a[u], b[v]);
}
auto query(int u, int v, int add = 1) {
	std::cout << "? " << u + add << " " << v + add;
	std::cout << std::endl;
	fflush(stdout);
	//return local(u, v);
	int get; std::cin >> get;
	return get;
}
void answer(std::vector<int>u, std::vector<int>v, int add = 0) {
	std::cout << "!";
	for (int i = 0; i < u.size(); ++i)std::cout << " " << u[i] + add;
	for (int i = 0; i < v.size(); ++i)std::cout << " " << v[i] + add;
	std::cout << std::endl;
	fflush(stdout);
}
std::vector<long long> sieveOfEratosthenes(long long  n = 1000000) {
	std::vector<bool>p(n + 1, true);
	std::vector<long long>ret;
	p[0] = false;
	p[1] = false;
	for (int i = 2; i <= n; ++i) {
		if (!p[i]) continue;
		ret.push_back(i);
		for (int j = 2 * i; j <= n; j += i) p[j] = false;
	}
	return ret;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	if (1 == n) {
		answer({ 1 }, { 1 });
		return 0;
	}
	auto sieve = sieveOfEratosthenes(n);
	auto prime = sieve.back();
	vector<int>p;
	rep(i, n) {
		auto get = query(i, i);
		if (0 == get % prime)p.push_back(i);
	}
	int pa, pb;
	if (1 != p.size()) {
		auto get = query(p[0], p[1]);
		if (0 == get % prime) {
			pa = p[0], pb = p[1];
		}
		else {
			pa = p[1], pb = p[0];
		}
	}
	else {
		pa = pb = p[0];
	}
	vector<int>a(n), b(n);
	a[pa] = b[pb] = prime;
	rep(i, n) {
		if (i == pa)continue;
		auto get = query(i, pb);
		a[i] = get / prime;
	}
	rep(i, n) {
		if (i == pb)continue;
		auto get = query(pa, i);
		b[i] = get / prime;
	}
	answer(a, b);
	return 0;
}