#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <iomanip>
#include <cmath>
#include <map>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9 + 7;
constexpr int INF = 1 << 30;

int main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(false);
  int N; cin >> N;

  bool res;
  vector<int> ans;
  for(int i = 1; i <= N; ++i) {
    cout << "? " << N-1 << endl;
    for(int j = 1; j <= N; ++j) {
      if(i == j) continue;
      cout << j << " ";
    }
    cout << endl;
    cin >> res;
    if(!res) ans.push_back(i);
  }

  cout << "! " << (int)ans.size() << endl;
  for(int i = 0; i < (int)ans.size(); ++i) cout << ans[i] << " \n"[i == (int)ans.size() - 1];
  return 0;
}