#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int N = 2e6 + 10;

random_device rd;
mt19937 rng(rd());

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

int a[N];

void solve(){
	int n;
	cin >> n;
	vector<int> v;
	for(int i = 1; i <= n; i++) v.push_back(i), a[i] = i;
	int sum = ask(v), m = n / 2;
	if(~m&1) m++;
	for(int i = 0; i < 29; i++){
		shuffle(a + 1, a + 1 + n, rng);
		v.clear();
		for(int j = 1; j <= m; j++){
			v.push_back(a[j]);
		}
		int r1 = ask(v);
		v.clear();
		for(int j = m + 1; j <= n; j++){
			v.push_back(a[j]);
		}
		int r2 = ask(v);
		r1 = sum + r1 - r2;
		if(r1 & 1){
			cout << "! NO" << endl;
			return;
		}
	}
	cout << "! YES" << endl;
}

int main(){
	int T = 1;
	while(T--) solve();
	return 0;
}

#include <bits/stdc++.h>

using namespace std;
typedef pair<int, int> pii;

void run(int n){
	printf("%d %d\n", n, n);
	for(int i = 2; i <= n; i++){
		printf("%d %d\n", i - 1, i);
	}
	printf("1 %d\n", n);
}

void run(int n, int m){
	vector<pii> e;
	for(int i = 1; i <= n; i++){
		for(int j = i + 1; j <= n; j++){
			e.push_back({i, j});
		}
	}
	for(int i = n + 2; i <= n + m; i++){
		e.push_back({i, i - 1});
	}
	e.push_back({1, n + 1});
	e.push_back({n, n + m});
	printf("%d %d\n", n + m, (int)e.size());
	for(pii i : e){
		printf("%d %d\n", i.first, i.second);
	}
}

void solve(){
	int k;
	scanf("%d", &k);
	if(k == 1){
		printf("2 1\n1 2\n");
		return;
	}
	if(k == 2){
		printf("4 4\n1 3\n2 3\n3 4\n1 2\n");
		return;
	}
	if(k <= 20){
		run(k);	
	}else{
		for(int i = 2; i <= 20; i++){
			for(int j = 2; j <= 20; j++){
				if(i + j > 20) break;
				int res = i * (i - 1) / 2 - 1 + j - 1 + 2 * (i - 1);
				if(res == k){
					run(i, j);
					return;	
				}
			}
		}
	}
}

int main(){
	int T = 1;
	while(T--) solve();
	return 0;
}