#include<bits/stdc++.h>
using namespace std;
const int N=1919810;
typedef long long ll;
typedef pair<ll,ll> PII;
int n,m,k;
int a[N],b[N];
char s[N];
vector<PII> e[N];
int d[N];
bool tf[N];


int query(vector<int> &v){
    cout<<"? "<<v.size()<<" ";
    for(auto x:v) cout<<x<<" ";
    cout<<endl;
    int x;
    cin>>x;
    return x;
}

mt19937 rnd(time(0));
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin>>n;
    vector<int> v;
    for(int i=1;i<=n;i++) v.push_back(i);
    ll tot=query(v);
    if(tot<n){
        cout<<"! NO"<<endl;
            return 0;
    }
    set<int> se;
    for(int i=1;i<=n;i++) se.insert(i);
    int t1;
    for(int i=1;i<=59&&i<=n;i++){
        vector<int> v;
        while(!se.count(t1))
        t1=rnd()%n+1;
        for(int j=1;j<=n;j++){
            if(j==t1) continue;
            v.push_back(j);
        }
        if((tot-query(v)&1)){
            cout<<"! NO"<<endl;
            return 0;
        }
        se.erase(se.find(t1));
    }
    cout<<"! YES"<<endl;
}