#include <functional>
#include <algorithm>
#include <iostream>
#include <utility>
#include <sstream>
#include <iomanip>
#include <numeric>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <cstring>
#include <vector>
#include <cstdio>
#include <string>
#include <stack>
#include <deque>
#include <queue>
#include <cmath>
#include <map>
#include <set>
#define lwb lower_bound
#define upb upper_bound
#define X first
#define Y second
#define coud(a,b) cout<<fixed << setprecision((b)) << (a)
#define L(x) ((x)<<1)
#define R(x) (((x)<<1)+1)
//#define int long long
#define double long double
#define joon ios :: sync_with_stdio(false)
//#define cin fin
//#define cout fout

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
const double pi = acos(-1);
const double eps = 1e-7;
int fib[100];
map< int , int > chandomfib;// fibonacci index

int main()
{
	fib[1]=1;
	chandomfib[1]=1;
	chandomfib[2]=2;
	fib[2]=2;
	for(int i=3;i<=20;i++)
	{
		fib[i]=fib[i-1]+fib[i-2];
		chandomfib[ fib[i] ]=i;
	}
	int n;
	cin>>n;
	if(n<11)
	{
		cout<<"Not enough money"<<endl;
		return 0;
	}
	cout<<"Let's play!"<<endl;
	fflush(stdout);
	int l=1;
	int r=144;
	int tmp=0;
	while(r-l+1>2)
	{
	//	cout<<l<<" "<<r<<endl;
		int len=r-l+1;
		int ind=chandomfib[len];
		ind--;
		cout<<fib[ind-1]<<" ";
		for(int i=r-fib[ind-1]+1;i<=r;i++)
			cout<<i<<" ";
		cout<<endl;
		fflush(stdout);
		string judge;
		cin>>judge;
		if(fib[ind-1]==1 && judge[0]=='Y')
		{
			cout<<0<<" "<<r-fib[ind-1]+1<<endl;
			return 0;
		}
		if(judge[0]=='Y')
			l=r-fib[ind-1]+1;
		else
			r-=fib[ind-1];
	}
	cout<<1<<" "<<r<<endl;
	fflush(stdout);
	string judge;
	cin>>judge;
	int ans=l;
	if(judge[0]=='Y')
		ans=r;
	cout<<0<<" "<<ans<<endl;
	fflush(stdout);
	return 0;
}