#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
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; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int N;
	cin >> N;
	auto query = [](int i, int j) -> pii {
		cout << "? " << i << " " << j << endl;
		int p, q;
		cin >> p >> q;
		return {p, q};
	};
	
	if (N == 2) {
		auto res = query(1, 2);
		if (res.second == 1) puts("! 1 2");
		else puts("! 2 1");
		return 0;
	}
	
	vector<pii> res(N * N - N);
	FOR(i, 1, N * N - N) res[i] = query(1, i + 1);
	
	const int bias = N;
	vector<int> cnt(2 * N);
	FOR(i, 1, res.size()) {
		++cnt[res[i].first + bias];
		++cnt[res[i].second + bias];
	}
	
	int mx = -INF, mn = INF;
	REP(i, cnt.size()) {
		if (!cnt[i]) continue;
		chmax(mx, i - bias);
		chmin(mn, i - bias);
	}
	
	vector<pii> ans(res.size(), {-INF, -INF});
	if (cnt[mx + bias] == (N - 1) - 1 || cnt[mn + bias] == (N - 1) - 1) { // A_1 <= B_1
		ans[0] = {mn + (N - 1), mx};
	}
	else { // A_1 > B_1
		ans[0] = {mx + 1, mn + (N - 1)};
	}
	
	map<pii, vector<int>> mm; // (p, q) = {idx...}
	FOR(i, 1, res.size()) {
		if (res[i].first == res[i].second) ans[i] = {ans[0].first - res[i].first, ans[0].second - res[i].second};
		else mm[res[i]].emplace_back(i);
	}
	
	int tidx = 0;
	for (const auto & [p, vec] : mm) {
		if (vec.size() != 1) continue;
		int t1 = ans[0].first - p.first, t2 = ans[0].second - p.second;
		if (!(1 <= t1 && t1 < N && 0 <= t2 && t2 < N)) {
			t1 = ans[0].first - p.second;
			t2 = ans[0].second - p.first;
		}
		ans[vec[0]] = {t1, t2};
		if (ans[0].first <= ans[0].second && ans[vec[0]] == pii{N - 1, 0}) tidx = vec[0];
		if (ans[0].first > ans[0].second && ans[vec[0]] == pii{1, N - 1}) tidx = vec[0];
	}
	
	for (const auto & [p, vec] : mm) {
		if (vec.size() == 1) continue;
		auto q = query(tidx + 1, vec[0] + 1);
		pii pred1 {ans[0].first - p.first, ans[0].second - p.second};
		pii pred2 {ans[0].first - p.second, ans[0].second - p.first};
		if (ans[0].first <= ans[0].second) ans[vec[0]] = {N - 1 - q.second, 0 - q.first};
		else ans[vec[0]] = {1 - q.first, N - 1 - q.second};
		ans[vec[1]] = ans[vec[0]] == pred1 ? pred2 : pred1;
	}
	
	cout << "! ";
	REP(i, ans.size()) cout << ans[i].first * N + ans[i].second << " \n"[i + 1 == ans.size()];
	cout << flush;
}