#include <bits/stdc++.h>
#include "message.h"
using namespace std;
void send_message(vector<bool> M, vector<bool> C){
	M.push_back(false);
	while(M.size()<1025)M.push_back(true);
	int idx=0;
	vector<int> d,pos;
	for(int i=0;i<31;i++)if(!C[i])pos.push_back(i);
	for(int i=0;i<31;i++)d.push_back(0);
	for(int i=0;i<16;i++)d[pos[i]]=(pos[(i+1)%16]-pos[i]+31)%31;
	for(int i=1;i<=66;i++){
		vector<bool> res;
		for(int j=0;j<31;j++){
			if(C[j])res.push_back(false);
			else{
				if(i<d[j])res.push_back(false);
				else if(i==d[j])res.push_back(true);
				else{
					res.push_back(M[idx]);
					idx++;
				}
			}
		}
		send_packet(res);
	}
}
vector<bool> receive_message(vector<vector<bool> > R){
	vector<int> d;
	vector<bool> st,ok,res;
	for(int i=0;i<31;i++)d.push_back(0),st.push_back(false),ok.push_back(false);
	for(int i=0;i<66;i++)
		for(int j=0;j<31;j++)if(!d[j]&&R[i][j])d[j]=i+1;
	for(int i=0;i<31;i++){
		int cur=i,sum=0;
		while(!st[cur]){
			sum++;
			st[cur]=sum;
			(cur+=d[cur])%=31;
		}
		if(sum-st[cur]+1==16){
			int curcur=(cur+d[cur])%31;
			ok[cur]=1;
			while(curcur!=cur){
				ok[curcur]=1;
				(curcur+=d[curcur])%=31;
			}
			break;
		}
	}
	for(int i=0;i<31;i++)st[i]=0;
	for(int i=0;i<66;i++)
		for(int j=0;j<31;j++)if(ok[j]){
			if(st[j])res.push_back(R[i][j]);
			else if(R[i][j])st[j]=1;
		}
	while(res.back())res.pop_back();
	assert(res.size());
	res.pop_back();
	return res;
}