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

int n;
int tot=66;
bool B[100][31];
int pos[31];
// int cnt;
void get_nxt(int &k,vector<bool> C){
    // cnt++;
    if(pos[k]+1>=tot){
        k++;
        while(C[k]) k++;
    }
    else pos[k]++;
}
void send_message(vector<bool> A,vector<bool> C){
    memset(pos,0,sizeof(pos));
    memset(B,0,sizeof(B));
    n = A.size();
    for(int i=0;i<31;i++){
        if(C[i]) continue;
        int j = (i+1)%31;
        while(C[j]) j=(j+1)%31;
        pos[i] = (j-i+31)%31-1;
        B[pos[i]++][i] = 1;
    }
    int k=0;
    while(C[k]) k++;
    for(int i=1024;i>n;i--){
        B[pos[k]][k] = 0;
        get_nxt(k,C);
    }
    B[pos[k]][k] = 1;
    get_nxt(k,C);
    for(int i=0;i<n;i++){
        B[pos[k]][k] = A[i];
        if(i<n-1) get_nxt(k,C);
    }
    vector<bool> p(31,0);
    for(int i=0;i<tot;i++){
        for(int j=0;j<31;j++)
            p[j] = B[i][j];//,printf("%d ",B[i][j]);
        // puts("");
        send_packet(p);
    }
}
bool flg;
int fa[31];
int stk[35],top;
vector<bool> C(31,0);
void dfs(int u){
    if(pos[u]){
        if(top-pos[u]+1==16){
            flg=1;
            for(int i=pos[u];i<=top;i++)
                C[stk[i]]=0;
        }
        return;
    }
    stk[++top] = u;
    pos[u] = top;
    dfs(fa[u]);
}
vector<bool> res;
vector<bool> receive_message(vector<vector<bool>> A){
    for(int i=0;i<31;i++){
        fa[i]=0;
        while(fa[i]<31 && A[fa[i]][i]==0) fa[i]++;
        fa[i] += i+1;
        fa[i] %= 31;
    }
    for(int i=0;i<31;i++) C[i]=1,pos[i]=0;
    flg=top=0;
    for(int i=0;i<31;i++)
        if(!pos[i] && !flg) dfs(i);
    for(int i=0;i<31;i++){
        pos[i] = 0;
        if(C[i]) continue;
        pos[i] = (fa[i]-i+31)%31;
    }
    int k = 0;
    while(C[k]) k++;
    int n = 1024;
    // cnt=0;
    // for(int i=0;i<31;i++) cnt+=pos[i];
    // cerr<<cnt<<endl;
    while(!A[pos[k]][k]){
        n--;
        get_nxt(k,C);
    }
    get_nxt(k,C);
    res.resize(n);
    for(int i=0;i<n;i++){
        res[i] = A[pos[k]][k];
        get_nxt(k,C);
    }
    // cerr<<cnt<<endl;
    // cerr<<pos[k]<<endl;
    return res;
}