#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define endl codeforces #define ALL(v) std::begin(v), std::end(v) #define ALLR(v) std::rbegin(v), std::rend(v) using ll = std::int64_t; using ull = std::uint64_t; using pii = std::pair; using tii = std::tuple; using pll = std::pair; using tll = std::tuple; using size_type = ssize_t; template using vec = std::vector; template using vvec = vec>; template const T& var_min(const T &t) { return t; } template const T& var_max(const T &t) { return t; } template const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); } template const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); } template void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); } template void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); } template struct multi_dim_array { using type = std::array::type, Head>; }; template struct multi_dim_array { using type = std::array; }; template using mdarray = typename multi_dim_array::type; template void fill_seq(T &t, F f, Args... args) { if constexpr (std::is_invocable::value) { t = f(args...); } else { for (size_type i = 0; i < t.size(); i++) fill_seq(t[i], f, args..., i); } } template vec make_v(size_type sz) { return vec(sz); } template auto make_v(size_type hs, Tail&&... ts) { auto v = std::move(make_v(std::forward(ts)...)); return vec(hs, v); } namespace init__ { struct InitIO { InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } } init_io; } template T ceil_pow2(T bound) { T ret = 1; while (ret < bound) ret *= 2; return ret; } template T ceil_div(T a, T b) { return a / b + !!(a % b); } constexpr size_type SIZE = 104; constexpr size_type offset = SIZE / 2; mdarray, SIZE, SIZE> qres; pii query(int i, int j) { std::cout << "? " << i + 1 << " " << j + 1 << "\n" << std::flush; int p, q; std::cin >> p >> q; return pii(p, q); } const vec& get_res(int p, int q) { return qres[p + offset][q + offset]; } void set_res(int p, int q, int i) { qres[p + offset][q + offset].push_back(i); } int main() { int n; std::cin >> n; vec res; res.reserve(n * n - n - 1); for (int i = 1; i < n * n - n; i++) { auto [ p, q ] = query(0, i); res.emplace_back(p, q, i); set_res(p, q, i); } std::sort(ALL(res)); vec ans(n * n - n, -1); int v00 = -1, v01 = -1; { auto [ p, q, i ] = res.front(); if (p < 0 || q < 0) { ans[i] = n * n - 1; } else { ans[0] = n * n - 1; } if (p == q) v00 = v01 = p + (n - 1); } auto exec = [&](int u, int v) { int v1 = u / n - v / n; int v2 = u % n - v % n; if (v1 > v2) std::swap(v1, v2); return pii(v1, v2); }; int idx10; { auto [ p, q, i ] = res.back(); if (0 <= p && 0 <= q) { ans[i] = n; idx10 = i; if (v00 == -1) { int tmp = (p + 1) * n + q; auto rres = pii(std::get<0>(res.front()), std::get<1>(res.front())); if (exec(tmp, n * n - 1) == rres) { v01 = p + 1; v00 = q; } else { v01 = q + 1; v00 = p; } } } else { ans[0] = n; idx10 = 0; v00 = 0; v01 = 1; } } ans[0] = v01 * n + v00; auto check = [&](int v0, int v1) { auto cnts = make_v(SIZE, SIZE); for (int v = n; v < n * n; v++) { int p = v1 - v / n; int q = v0 - v % n; if (p == 0 && q == 0) continue; if (p > q) std::swap(p, q); cnts[p + offset][q + offset]++; } for (int i = -n; i <= n; i++) for (int j = -n; j <= n; j++) { if (get_res(i, j).size() != cnts[i + offset][j + offset]) return false; } return true; }; if (!check(v00, v01)) std::swap(v00, v01); auto valid = [&](int v0, int v1) { return 0 <= v0 && v0 < n && 1 <= v1 && v1 < n; }; auto get_valid_v = [&](int d1, int d0, int ov1, int ov0) { int v0 = ov0 - d0, v1 = ov1 - d1; if (valid(v0, v1)) return v1 * n + v0; return (ov1 - d0) * n + (ov0 - d1); }; for (int i = -n; i <= n; i++) for (int j = -n; j <= n; j++) { vec rij; for (int e : get_res(i, j)) if (ans[e] == -1) rij.push_back(e); if (rij.empty()) continue; if (rij.size() == 1) { int tv0 = v00 - i, tv1 = v01 - j; if (valid(tv0, tv1)) ans[rij[0]] = tv1 * n + tv0; else ans[rij[0]] = (v01 - i) * n + (v00 - j); } else { auto [ p, q ] = query(idx10, rij[0]); ans[rij[0]] = [&] { int v0 = -q, v1 = 1 - p; do { if (!valid(v0, v1)) break; if (!valid(v1, v0)) break; int v = v1 * n + v0; if (exec(n, v) != pii(i, j)) break; return v; } while (false); v0 = -p; v1 = 1 - q; return v1 * n + v0; }(); int v = ans[rij[0]]; int rv = (v % n) * n + (v / n); ans[rij[1]] = rv; } } std::cout << "!"; for (int e : ans) std::cout << ' ' << e; std::cout << "\n" << std::flush; return 0; }