#include <bits/stdc++.h>
using namespace std;

bool query(int);
void modify(int,bool);

bool WereYouLast(int N, int m){
	if(N == (1<<10)){
		int num = 0;
		
		for(int i = 0; i < 10; i++){
			num += ((int)query(i+1)<<i);
		}		
		if(num == (1<<10)-1) return 1;
		
		num++;
		
		for(int i = 0; i < 10; i++){
			modify(i+1,(num&(1<<i))>0);
		}

		
		return 0;
	}
	else if(N == (1<<16)){
		bitset<65> arr("00000000000000000000000000000000010000000110011101000010111000000");
		
		int num = 1;
		bool die = true;
		int l[6];
		bool blob[6];
		int s = 5;
		for(int i = 0; i < 5; i++){
			blob[i] = query(num);
			die &= (blob[i]^arr[num]);
			l[i]= num;
			num = num * 2;
			if(blob[i]^arr[num/2]) num++; 
		}
		if(die) return 1;
		
		for(int i = s - 1; i >= 0; i--){
			if(!(blob[i]^arr[l[i]]) ){
				modify(l[i],!arr[l[i]]);
				s = i - 1;
				break;
			}
			modify(l[i],arr[l[i]]);
		}

		for(int i = s; i >= 0; i--){
			modify(l[i],arr[l[i]]);
		}
		return 0;
	}
	else if(N == (1<<20)){
		bitset<65> arr("00000000000000000000000000000000011001000110000010000010000000000");
		
		int num = 1;
		bool die = true;
		int l[6];
		bool blob[6];
		int s = 5;
		for(int i = 0; i < 5; i++){
			blob[i] = query(num);
			die &= (blob[i]^arr[num]);
			l[i]= num;
			num = num * 2;
			if(blob[i]^arr[num/2]) num++; 
		}
		if(die) return 1;
		
		for(int i = s - 1; i >= 0; i--){
			if(!(blob[i]^arr[l[i]]) ){
				modify(l[i],!arr[l[i]]);
				s = i - 1;
				break;
			}
			modify(l[i],arr[l[i]]);
		}

		for(int i = s; i >= 0; i--){
			modify(l[i],arr[l[i]]);
		}
		return 0;
	}
	else if(true){
		bitset<65> arr("00000000000000000001101001100101000000000100001111000010000000000");
		
		int num = 1;
		bool die = true;
		int l[6];
		bool blob[6];
		int s = 6;
		for(int i = 0; i < 6; i++){
			blob[i] = query(num);
			die &= (blob[i]^arr[num]);
			l[i]= num;
			num = num * 2;
			if(blob[i]^arr[num/2]) num++; 
			if( arr[1]^blob[0] && i == 3){
				s = 4;
				break;
			}
		}
		if(die) return 1;
		
		for(int i = s - 1; i >= 0; i--){
			if(!(blob[i]^arr[l[i]]) ){
				modify(l[i],!arr[l[i]]);
				s = i - 1;
				break;
			}
			modify(l[i],arr[l[i]]);
		}

		for(int i = s; i >= 0; i--){
			modify(l[i],arr[l[i]]);
		}
		return 0;
	}
	return 1;

}