#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
const double PI = acos(-1);
const ll MOD = 1000000007;
using Graph = vector<vector<int>>;

int main() {
  int N; cin >> N;
  vector<int> a(N),b(0);

  int K = 0;
  rep(i,N) {
    cout << "? " << N-1 << endl;
    rep(j,N) {
      if (i == j) continue;
      cout << j+1 << " ";
    }
    cout << endl;

    int ans; cin >> ans;
    if (ans == 0) {
      K++;
      b.push_back(i+1);
    }   
  }

  cout << "! " << K << endl;
  rep(i,b.size()) cout << b[i] << " ";
  cout << endl;
}