#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 4000000000000000001LL

bool is_p(int n){
	for(int i=2;i<n;i++){
		if(n%i==0){
			return false;
		}
	}
	return true;
}
int main(){
	/*
	for(int i=100;i<=100000;i++){
		if(is_p(i)==false){
			continue;
		}
		for(long long j=i-1;j<=100000;j+=(i-1)){
			auto res = pow_mod(j,i,1000000007);
			if(res%i==0){
				cout<<i<<' '<<j<<endl;
			}
		}
	}
		*/
	int A= 139,B = 58512;
	swap(A,B);
	cout<<A<<' '<<B<<endl;
	int K;
	cin>>K;
	if(K==B)cout<<0<<endl;
	else cout<<1<<endl;
	int res;
	cin>>res;
	assert(res==1);
	return 0;
}