#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int main()
{
	int n;
	cin>>n;
	vector<int> ans;
	bool used[1010]={};
	for(int i=2; i<=n+1; i++){
		int m=ans.size()+n-i+1;
		if(m==1 && i==n){
			cout<<"! "<<2<<"\n";
			cout<<n-1<<" "<<n<<endl;
			return 0;
		}
		if(m==1 && i==n+1){
			cout<<"! "<<2<<"\n";
			cout<<ans[0]<<" "<<n<<endl;
			return 0;
		}
		cout<<"? "<<m<<"\n";
		for(auto x:ans) cout<<x<<" ";
		for(int j=i; j<=n; j++) cout<<j<<" ";
		cout<<endl;
		int r;
		cin>>r;
		if(r==0){
			ans.push_back(i-1);
			used[i-1]=1;
		}
	}
	cout<<"! "<<ans.size()<<"\n";
	for(auto x:ans){
		cout<<x<<" ";
	}
	cout<<endl;
	return 0;
}