#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N;
int num[1010];


int ask(int v) {
	static int step=0;
	step++;
	assert(step<30);
	
	cout<<10000<<" "<<v+1<<endl;
	int i;
	FOR(i,v) cout<<i<<" ";
	cout<<v<<endl;
	cin>>v;
	return v;
}

void dfs(int L,int R) {
	int i;
	if(num[L]==num[R]) {
		for(i=L+1;i<R;i++) num[i]=num[L];
		return;
	}
	if(L+1==R) return;
	int M=(L+R)/2;
	num[M]=ask(M);
	dfs(L,M);
	dfs(M,R);
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	num[0]=0;
	num[N]=ask(N);
	dfs(0,N);
	
	int sum=0;
	FOR(i,N) sum+=5-num[i];
	cout<<"0 1"<<endl;
	cout<<sum<<endl;
	
	
		
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}