#include<bits/stdc++.h>
#define LL long long
#define pb push_back
#define SZ(x) ((int)x.size()-1)
#define ms(a,b) memset(a,b,sizeof a)
#define F(i,a,b) for (int i=(a);i<=(b);++i)
#define DF(i,a,b) for (int i=(a);i>=(b);--i)
//#define mp make_pair
//#define OO(x) fixed<<setprecision(x)
using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
inline int read(){
	char ch=getchar(); int w=1,c=0;
	for(;!isdigit(ch);ch=getchar()) if (ch=='-') w=-1;
	for(;isdigit(ch);ch=getchar()) c=(c<<1)+(c<<3)+(ch^48);
	return w*c;
}
const int M=1e6+10;
int n,m; 
int ask(vector<int> s){
	if (!s.size()) return 0;
	cout<<"? ";
	cout<<s.size()<<" ";
	for (int x:s) cout<<x<<" ";
	cout<<endl;
	int o=read();
	return o;
}
int main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	n=read();
	cout<<"? "<<n;
	F(i,1,n) cout<<" "<<i;
	cout<<endl;
	m=read();
	F(T,1,30){
		vector<int> X,Y;
		F(i,1,n){
			if (rnd()&1) X.pb(i);
			else Y.pb(i);
		}
		if ((m-ask(X)-ask(Y))%2==1){
			cout<<"! NO"<<endl;
			return 0;
		}
	}
	cout<<"! YES"<<endl;
	return 0;
}
/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* WRITE STUFF DOWN
	* DON'T GET STUCK ON ONE APPROACH
*/