#include<bits/stdc++.h>
#define rep(i, l, r) for(int i = (l); i <= (r); i ++)
#define per(i, r, l) for(int i = (r); i >= (l); i --)
#define trv(i, u, v) for(int i = head[u], v = e[i].to; i; v = e[i = e[i].nxt].to)
#define fi first
#define se second
#define all(s) s.begin(), s.end()
#define sz(s) (int)(s.size())
#define lb(s) ((s) & -(s))
#define pb push_back
using namespace std;

typedef long long ll;
typedef pair<int, int> P;
mt19937_64 hua(time(0));
template<typename T> inline bool chkmx(T &x, T y) {return x < y ? x = y, 1 : 0;}
template<typename T> inline bool chkmn(T &x, T y) {return y < x ? x = y, 1 : 0;}
template<int T> using A = array<int, T>;

inline int read() {
	int x = 0, f = 1; char c = getchar();
	for(; !isdigit(c); c = getchar()) if(c == '-')  f = 0;
	for(; isdigit(c); c = getchar()) x = x * 10 + c - '0';
	return f ? x : -x;
}
const int maxn = 1e4;
int n;
inline int ask(vector<int> s) {
	cout << "? " << sz(s) << ' ';
	for(auto x : s) cout << x << ' '; cout << endl; 
	int sum; cin >> sum;
	return sum;
}
inline int rnd(int l, int r) {return hua() % (r - l + 1) + l;}
vector<int> s, t;
int main() {
//	freopen("in.txt", "r", stdin);
	cin >> n;
	vector<int> s;
	rep(i, 1, n) s.pb(i);
	int all = ask(s);
	rep(i, 1, 29) {
		s.clear(), t.clear();
		rep(i, 1, n) {
			if(rnd(0, 1)) s.pb(i);
			else t.pb(i);
		}
		int cur = ask(s) + ask(t);
		if(all - cur & 1) {
			cout << "! NO" << endl;
			return 0;
		}
	}
	cout << "! YES" << endl;
	return 0;
}