#include <bits/stdc++.h>
#define ll long long
#define ls id << 1
#define rs id << 1 | 1
#define mem(array, value, size, type) memset(array, value, ((size) + 5) * sizeof(type))
#define memarray(array, value) memset(array, value, sizeof(array))
#define fillarray(array, value, begin, end) fill((array) + (begin), (array) + (end) + 1, value)
#define fillvector(v, value) fill((v).begin(), (v).end(), value)
#define pb(x) push_back(x)
#define st(x) (1LL << (x))
#define pii pair<int, int>
#define mp(a, b) make_pair((a), (b))
#define Flush fflush(stdout)
#define vecfirst (*vec.begin())
#define veclast (*vec.rbegin())
#define vecall(v) (v).begin(), (v).end()
#define vecupsort(v) (sort((v).begin(), (v).end()))
#define vecdownsort(v, type) (sort(vecall(v), greater<type>()))
#define veccmpsort(v, cmp) (sort(vecall(v), cmp))
using namespace std;
const int N = 500050;
const int inf = 0x3f3f3f3f;
const ll llinf = 0x3f3f3f3f3f3f3f3f;
const int mod = 998244353;
const int MOD = 1e9 + 7;
const double PI = acos(-1.0);
clock_t TIME__START, TIME__END;
void program_end()
{
#ifdef ONLINE
    printf("\n\nTime used: %.6lf(s)\n", ((double)TIME__END - TIME__START) / 1000);
    system("pause");
#endif
}
int n,m;
int ask(vector<int>p)
{
    cout << "? " << p.size();
    for(auto i : p)
        cout << " " << i;
    cout<<endl;
    int k;
    cin>>k;
    return k;
}

inline void solve()
{
    cin>>n;
    vector<int>p;for(int i=1;i<=n;++i)p.push_back(i);
    int m=ask(p);
    int alld=2*m;
    for(int i=1;i<=29;++i)
    {
        set<int>pos;
        while(pos.size()*2<n)
        {
            int x=rand()%n+1;
            if(pos.count(x))continue;
            pos.insert(x);
        }
        p.clear();
        for(auto i : pos)p.push_back(i);
        int sz1=ask(p);
        p.clear();
        for(int j=1;j<=n;++j)if(!pos.count(j))p.push_back(j);
        int sz2=ask(p);
        int real_sz=m-sz1-sz2;
        if(real_sz%2)
        {
            cout<<"! NO"<<endl;
            return;
        }
    }
    cout<<"! YES"<<endl;
}

int main()
{
    random_device rd;
    srand(rd());
    TIME__START = clock();
    int Test = 1;
    // scanf("%d", &Test);
    while (Test--)
    {
        solve();
        // if (Test)
        //     putchar('\n');
    }
    TIME__END = clock();
    program_end();
    return 0;
}