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

using namespace std;

typedef long long ll;

vector<bool> info[100];
ll nxt[50];
bool vis[50];

void send_message(vector<bool> M, vector<bool> C) {
    M.push_back(true);
    while (M.size() <= 1024) {
        M.push_back(false);
    }
    for (ll i=1; i<67; i++) {
        info[i].clear();
        info[i].resize(31);
    }
    ll prev, k=0;
    for (ll i=0; i<C.size(); i++) {
        if (!C[i]) {
            prev = i-31;
        }
    }
    for (ll i=0; i<C.size(); i++) {
        if (!C[i]) {
            ll distance = i-prev;
            for (ll j=1; j<distance; j++) {
                info[j][i] = 1;
            }
            for (ll j=distance+1; j<67; j++) {
                info[j][i] = M[k++];
            }
            prev = i;
        }
    }
    for (ll i=1; i<67; i++) {
        send_packet(info[i]);
    }
}

vector<bool> receive_message(vector<vector<bool>> R) {
    for (ll i=1; i<67; i++) {
        info[i] = R[i-1];
    }
    for (ll i=0; i<31; i++) {
        nxt[i] = 0;
        vis[i] = 0;
    }
    for (ll i=0; i<31; i++) {
        ll current = 1;
        while (current < 67 && info[current][i]) {
            ++current;
        }
        nxt[i] = (i+31-current%31)%31;
    }
    for (ll i=0; i<31; i++) {
        ll cycle = i;
        ll flag = 0;
        for (ll j=1; j<17; j++) {
            cycle = nxt[cycle];
            if (cycle == i) {
                if (j == 16) {
                    flag = 1;
                }
                else {
                    flag = -1;
                    break;
                }
            }
        }
        if (flag == 1) {
            cycle = i;
            for (ll j=1; j<17; j++) {
                cycle = nxt[cycle];
                vis[cycle] = 1;
            }
            break;
        }
    }
    
    vector<bool> answer;
    for (ll i=0; i<31; i++) {
        if (vis[i]) {
            ll current = 1;
            while (current < 67 && info[current][i]) {
                ++current;
            }
            for (ll j=current+1; j<67; j++) {
                answer.emplace_back(info[j][i]);
            }
        }
    }
    
    while (!answer.back()) {
        answer.pop_back();
    }
    answer.pop_back();
    return answer;
}