// I SELL YOU...! 
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<set>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
signed main(){
  ll n,res;
  cin >> n;
  ll ri,le;
  ri=1;
  set<ll> mzs;
  for(int i=n-1;i>1;i--){
    set<ll> tmp(mzs);
    for(int j=1;j<=i;j++){
      tmp.insert(j);
    }
    cout << "? "<<tmp.size()<<"\n";
    for(auto j:tmp){
      cout << j<<" ";
    }
    cout << endl;
    cin >> res;
    if(res==0) mzs.insert(i+1);
    cout << endl;
  }
  cout <<"? "<<mzs.size()<<"\n";
  for(auto i:mzs){
    cout << i<<" ";
  }
  cout << endl;
  cin >> res;
  if(res==0) mzs.insert(1);
  cout << "! "<<mzs.size()<<"\n";
  for(auto i:mzs){
    cout << i<<" ";
  }
  cout << endl;
}