#include "message.h"
#include<iostream>
#include<cstdio>
#include<cstdlib>
#define N 32
using namespace std;
const __int128 mod=((__int128)(1)<<69)-19;
int r[32],rd[30][32],tong[N+1],length;
bool used[32],delta[1025],nprime[N+1];
unsigned long long seed;
bool get_rand()
{
	seed^=(seed<<7);
	seed^=(seed<<13);
	seed^=(seed>>19);
	return seed&1;
}
void send_message(std::vector<bool> M, std::vector<bool> C)
{
	int ps=-1,rst=0,rst2=0;
	vector<bool>p;
	seed=998244353;
	for (int i=1;i<=10;++i)
		for (int j=0;j<=30;++j)
			rd[i][j]=get_rand();
	for (int i=0;i<=1024;++i) delta[i]=0;
	for (int i=0;i<M.size();++i) delta[i]=M[i];
	delta[M.size()]=1,length=0;
	for (int i=1;i<=N;++i) nprime[i]=0;
	for (int i=2;i<=N;++i)
		if (!nprime[i])
		{
			for (int j=(i<<1);j<=N;j+=i) nprime[j]=1;
		}
	for (int i=N;i>=2;--i)
		if (!nprime[i])
		{
			for (int j=1;j<=4;++j)
				if (length+1<=31)
					tong[++length]=i;
		}
	for (int i=0;i<=15;++i)
		if (!C[i])
			rst|=(1<<i);
	for (int i=16;i<=30;++i)
		if (!C[i])
			rst2|=(1<<(i-16));
	for (int i=1;i<=5;++i)
	{
		p.clear();
		for (int j=0;j<=30;++j)
		{
			if (!C[j]) p.push_back((((rst%tong[j+1])>>(i-1))&1)^rd[i][j]);
			else p.push_back(get_rand());
		}
		send_packet(p);
	}
	for (int i=1;i<=5;++i)
	{
		p.clear();
		for (int j=0;j<=30;++j)
		{
			if (!C[j]) p.push_back((((rst2%tong[j+1])>>(i-1))&1)^rd[i+5][j]);
			else p.push_back(get_rand());
		}
		send_packet(p);
	}
	for (int i=1;i<=66;++i)
	{
		p.clear();
		for (int j=0;j<=30;++j)
		{
			if (C[j]) p.push_back(get_rand());
			else if (ps+1<=1024) p.push_back(delta[++ps]);
			else p.push_back(get_rand());
		}
		send_packet(p);
	}
	return;
}
std::vector<bool> receive_message(std::vector<std::vector<bool>> R)
{
	int ps=-1,rst=0,rst2=0,cnt;
	vector<bool>p;
	vector<int>A;
	vector<int>B;
	seed=998244353;
	for (int i=1;i<=10;++i)
		for (int j=0;j<=30;++j)
			rd[i][j]=get_rand();
	for (int i=0;i<=1024;++i) delta[i]=0;
	length=0;
	for (int i=1;i<=N;++i) nprime[i]=0;
	for (int i=2;i<=N;++i)
		if (!nprime[i])
		{
			for (int j=(i<<1);j<=N;j+=i) nprime[j]=1;
		}
	for (int i=N;i>=2;--i)
		if (!nprime[i])
		{
			for (int j=1;j<=4;++j)
				if (length+1<=31)
					tong[++length]=i;
		}
	for (int i=0;i<=1024;++i) delta[i]=0;
	for (int i=1;i<=31;++i) r[i]=0;
	for (int i=1;i<=5;++i)
		for (int j=0;j<=30;++j)
			if (R[i+4][j]^rd[i+5][j])
				r[j+1]|=(1<<(i-1));
	for (int i=0;i<(1<<15);++i)
	{
		cnt=0;
		for (int j=1;j<=31;++j) cnt+=(i%tong[j]==r[j]);
		if (cnt>=16)
		{
			rst2=i;
			break;
		}
	}
	for (int i=1;i<=31;++i) r[i]=0;
	for (int i=1;i<=5;++i)
		for (int j=0;j<=30;++j)
			if (R[i-1][j]^rd[i][j])
				r[j+1]|=(1<<(i-1));
	for (int i=0;i<(1<<16);++i)
		if (__builtin_popcount(i)==16-__builtin_popcount(rst2))
		{
			cnt=0;
			for (int j=1;j<=31;++j) cnt+=(i%tong[j]==r[j]);
			if (cnt>=16)
			{
				rst=i;
				break;
			}
		}
	for (int i=1;i<=31;++i) r[i]=0;
	for (int i=1;i<=5;++i)
		for (int j=0;j<=30;++j)
			if (R[i+4][j]^rd[i+5][j])
				r[j+1]|=(1<<(i-1));
	for (int i=0;i<=15;++i) used[i]=(rst>>i)&1;
	for (int i=16;i<=30;++i) used[i]=(rst2>>(i-16))&1;
	for (int i=1;i<=66;++i)
		for (int j=0;j<=30;++j)
			if (used[j]&&ps+1<=1024)
				delta[++ps]=R[i+9][j];
	for (int i=ps;i>=0;--i)
		if (delta[i])
		{
			for (int j=0;j<=i-1;++j) p.push_back(delta[j]);
			break;
		}
	return p;
}