#include "message.h"
#include <bits/stdc++.h>

using namespace std;

void work(vector<bool> C)
{
    vector<bool> A;
    vector<int> pos;
    int p = 0, i, d;
    for(i = 0; i < 31; i++)
    	A.emplace_back(C[0]);
    send_packet(A);
    p = 1;
    if(!C[0])
    	pos.emplace_back(0);
    while(p < 31)
    {
    	if(pos.size() == 16)
    		break;
    	if(p - pos.size() == 15)
    	{
    		while(p < 31)
    			pos.emplace_back(p++);
    		break;
    	}
    	for(i = 0; i < 31; i++)
			A[i] = 0;
    	d = 0;
    	while(p < 31 && d < pos.size())
    	{
    		A[pos[d]] = C[p];
    		if(!C[p])
    			pos.emplace_back(p);
    		p++;
    		d++;
    	}
    	if(2 * (16 - pos.size()) > 31 - p)
    	{
    		// cerr << "!" << p << endl;
    		for(i = p; i < 31; i++)
    			A[i] = C[p];
    		if(!C[p])
    			pos.emplace_back(p);
    		p++;
    	}
    	send_packet(A);
    }
}
void send_message(std::vector<bool> M, std::vector<bool> C)
{
    M.emplace_back(1);
    while(M.size() & 15)
        M.emplace_back(0);
    int i, j, n = M.size(), p = 0;
    vector<bool> A;
    work(C);
    for(i = 0; i < n / 16; i++)
    {
        A.clear();
        for(j = 0; j < 31; j++)
            if(C[j])
                A.emplace_back(0);
            else
                A.emplace_back(M[p++]);
        send_packet(A);
    }
}

int solve(vector<vector<bool>> R, vector<bool> &C)
{
	int p = 0, i, d, c, x;
	vector<int> pos;
	c = 0;
	for(auto o: R[0])
		c += o;
	C[0] = (c > 15);
	if(!C[0])
		pos.emplace_back(0);
	p = x = 1;
	while(p < 31)
    {
    	if(pos.size() == 16)
    	{
    		while(p < 31)
    			C[p++] = 1;
    		break;
    	}
    	if(p - pos.size() == 15)
    	{
    		while(p < 31)
    		{
    			C[p] = 0;
    			pos.emplace_back(p++);
    		}
    		break;
    	}
    	d = 0;
    	while(p < 31 && d < pos.size())
    	{
    		C[p] = R[x][pos[d]];
    		if(!C[p])
    			pos.emplace_back(p);
    		p++;
    		d++;
    	}
    	if(2 * (16 - pos.size()) > 31 - p)
    	{
    		// cerr << "?" << p << endl;
    		c = 0;
    		for(i = p; i < 31; i++)
    			c += R[x][i];
    		C[p] = (2 * c > 31 - p);
    		if(!C[p])
    			pos.emplace_back(p);
    		p++;
    	}
    	x++;
    }
    return x;
}
std::vector<bool> receive_message(std::vector<std::vector<bool>> R)
{
	// cerr << "WOW" << endl;
    int i, j, c, x;
    vector<bool> C, M;
    C.resize(31);
    x = solve(R, C);
    // cerr << "DAMN" << endl;
    for(i = x; i < R.size(); i++)
    {
        for(j = 0; j < 31; j++)
            if(!C[j])
                M.emplace_back(R[i][j]);
    }
    while(!M.back())
        M.pop_back();
    M.pop_back();
    return M;
}