#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void read(T &x) {
  static char _c;
  static bool _f;
  x = 0;
  _f = 0;
  _c = getchar();
  while (_c < '0' || '9' < _c) {
    if (_c == '-') _f = true;
    _c = getchar();
  }
  while ('0' <= _c && _c <= '9') {
    x = (x << 1) + (x << 3) + (_c & 15);
    _c = getchar();
  }
  if (_f) x = -x;
}
template <typename T, typename... Args>
inline void read(T &x, Args &...args) {
  read(x);
  read(args...);
}
template <typename T>
inline void Min(T &x, T y) {
  if (y < x) x = y;
}
template <typename T>
inline void Max(T &x, T y) {
  if (x < y) x = y;
}
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3f;
const double pi = (double)acos(-1.0);
const double eps = (double)1e-8;
const int e5 = (int)1e5 + 5;
const int MOD = (int)1e9 + 7;
template <typename T0, typename T1>
inline void depair(T0 &x, T1 &y, pair<T0, T1> &p) {
  x = p.first, y = p.second;
}
inline int sig(double x) { return x < -eps ? -1 : eps < x; }
long long fp(long long a, long long n, long long mod = MOD) {
  if (n < 0) a = fp(a, mod - 2, mod), n = -n;
  long long res = 1;
  for (; n; n >>= 1, a = a * a % mod)
    if (n & 1) res = res * a % mod;
  return res;
}
struct Mint {
  int x;
  Mint() : x(0) {}
  Mint(int _x) : x(_x) {
    if (x >= MOD)
      x %= MOD;
    else if (x < 0)
      x = (x % MOD + MOD) % MOD;
  }
  Mint operator-() const { return Mint(MOD - x); }
  Mint operator+(const Mint &rhs) const {
    return Mint(x + rhs.x >= MOD ? x - MOD + rhs.x : x + rhs.x);
  }
  Mint operator-(const Mint &rhs) const {
    return Mint(x - rhs.x < 0 ? x - rhs.x + MOD : x - rhs.x);
  }
  Mint operator*(const Mint &rhs) const {
    return Mint((long long)x * rhs.x % MOD);
  }
  Mint operator/(const Mint &rhs) const {
    return Mint((long long)x * fp(rhs.x, -1) % MOD);
  }
  Mint &operator+=(const Mint &rhs) {
    x += rhs.x;
    if (x >= MOD) x -= MOD;
    return *this;
  }
  Mint &operator-=(const Mint &rhs) {
    x -= rhs.x;
    if (x < 0) x += MOD;
    return *this;
  }
  Mint &operator*=(const Mint &rhs) {
    x = ((long long)x * rhs.x) % MOD;
    return *this;
  }
  Mint &operator/=(const Mint &rhs) {
    x = (long long)x * fp(rhs.x, -1) % MOD;
    return *this;
  }
  bool operator==(const Mint &rhs) const { return x == rhs.x; }
  bool operator!=(const Mint &rhs) const { return x != rhs.x; }
  friend ostream &operator<<(ostream &out, const Mint &rhs) {
    return out << rhs.x;
  }
  friend istream &operator>>(istream &in, Mint &rhs) { return in >> rhs.x; }
  Mint rev() { return Mint(fp(x, -1)); }
  Mint pow(int k) { return Mint(fp(x, k)); }
  Mint pow(const Mint &t) { return Mint(fp(x, t.x)); }
};
const int maxn = (int)1e6 + 20;
const int maxm = (int)2e6 + 20;
void work() {
  int n;
  cin >> n;
  vector<int> mask(n);
  for (int i = 0, j = 0; i < n; i++) {
    auto popcount = [](int x) {
      int cnt = 0;
      while (x) {
        cnt++;
        x -= ((x) & -(x));
      }
      return cnt;
    };
    while (popcount(j) != 6) j++;
    mask[i] = j++;
  }
  vector<long long> v(13);
  for (int i = 0; i < 13; i++) {
    vector<int> s;
    for (int j = 0; j < n; j++)
      if (mask[j] >> i & 1) s.push_back(j);
    if (s.size() == 0) {
      v[i] = 0;
    } else {
      printf("? %d ", s.size());
      for (int k = 0; k < s.size(); k++)
        printf("%d%c", s[k] + 1, " \n"[k == s.size() - 1]);
      fflush(stdout);
      read(v[i]);
    }
  }
  vector<long long> ans(n, 0);
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < 13; j++)
      if (~mask[i] >> j & 1) ans[i] |= v[j];
  }
  printf("! ");
  for (int i = 0; i < n; i++) printf("%lld%c", ans[i], " \n"[i == n - 1]);
  fflush(stdout);
}
int main() {
  int tc = 1;
  for (int ca = 1; ca <= tc; ca++) {
    work();
  }
  return 0;
}
