#include using namespace std; using int64 = long long; const int mod = 1e9 + 7; // const int mod = 998244353; const int64 infll = (1LL << 62) - 1; const int inf = (1 << 30) - 1; struct IoSetup { IoSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(10); cerr << fixed << setprecision(10); } } iosetup; template< typename T1, typename T2 > ostream &operator<<(ostream &os, const pair< T1, T2 > &p) { os << p.first << " " << p.second; return os; } template< typename T1, typename T2 > istream &operator>>(istream &is, pair< T1, T2 > &p) { is >> p.first >> p.second; return is; } template< typename T > ostream &operator<<(ostream &os, const vector< T > &v) { for(int i = 0; i < (int) v.size(); i++) { os << v[i] << (i + 1 != v.size() ? " " : ""); } return os; } template< typename T > istream &operator>>(istream &is, vector< T > &v) { for(T &in : v) is >> in; return is; } template< typename T1, typename T2 > inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); } template< typename T1, typename T2 > inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); } template< typename T = int64 > vector< T > make_v(size_t a) { return vector< T >(a); } template< typename T, typename... Ts > auto make_v(size_t a, Ts... ts) { return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...)); } template< typename T, typename V > typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) { t = v; } template< typename T, typename V > typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) { for(auto &e : t) fill_v(e, v); } template< typename F > struct FixPoint : F { FixPoint(F &&f) : F(forward< F >(f)) {} template< typename... Args > decltype(auto) operator()(Args &&... args) const { return F::operator()(*this, forward< Args >(args)...); } }; template< typename F > inline decltype(auto) MFP(F &&f) { return FixPoint< F >{forward< F >(f)}; } pair< int, int > ask(int x, int y) { cout << "? " << x + 1 << " " << y + 1 << endl; int p, q; cin >> p >> q; return {p, q}; } int main() { int N; cin >> N; int M = N * N - N; vector< int > ans(M, -1); auto f = [&](int a, int b) { int x = a / N - b / N; int y = a % N - b % N; if(x > y) swap(x, y); return make_pair(x, y); }; vector< pair< int, int > > ret; for(int i = 1; i < M; i++) { ret.emplace_back(ask(0, i)); } { auto xs{ret}; sort(begin(xs), end(xs)); for(int i = 0; i < M; i++) { vector< pair< int, int > > X; for(int j = 0; j < M; j++) { if(i == j) continue; X.emplace_back(f(i + N, j + N)); } sort(begin(X), end(X)); if(X == xs) { ans[0] = i + N; break; } } } map< int, vector< int > > mp; for(int i = 0; i < M; i++) { for(int j = 0; j < M; j++) { if(ret[i] == f(ans[0], j + N)) { mp[j + N].emplace_back(i); break; } } } while(mp.size()) { auto it = begin(mp); while(it != end(mp)) { if(it->second.size() == 1) { ans[it->second.front()] = it->first; it = mp.erase(it); continue; } int x = it->first; int y = -1; for(int i = x + 1; i < N * N; i++) { if(f(ans[0], x) == f(ans[0], i)) { y = i; break; } } assert(~y); bool check = false; for(int i = 0; i < M; i++) { if(ans[i] == -1) continue; if(f(ans[i], x) != f(ans[i], y)) { auto beet = ask(i, it->second.front()); if(beet == f(ans[i], x)) { ans[it->second.front()] = x; ans[it->second.back()] = y; } else { ans[it->second.front()] = y; ans[it->second.back()] = x; } check = true; break; } } if(check) { it = mp.erase(it); } else { ++it; } } } cout << "! " << ans << endl; }