#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;

#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
// const int dy[] = {1, 1, 0, -1, -1, -1, 0, 1},
//           dx[] = {0, -1, -1, -1, 0, 1, 1, 1};

struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
    cerr << fixed << setprecision(10);
  }
} iosetup;
/*-------------------------------------------------*/
int main() {
  int n; cin >> n;
  vector<int> b;
  REP(i, n) {
    vector<int> a(n);
    iota(ALL(a), 0);
    a.erase(a.begin() + i);
    cout << "? " << n - 1 << endl;
    REP(j, a.size()) {
      cout << a[j] + 1;
      if (j + 1 == a.size()) {
        cout << endl;
      } else {
        cout << ' ';
      }
    }
    int ans; cin >> ans;
    if (ans == 0) b.emplace_back(i);
  }
  int k = b.size();
  cout << "! " << k << endl;
  REP(i, k) {
    cout << b[i] + 1;
    if (i + 1 == k) {
      cout << endl;
    } else {
      cout << ' ';
    }
  }
  return 0;
}