#include "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>
using namespace std;
void encode(int N, int M[]) {
int cnt = 0;
for (int i = 0; i < N; i++)
for (int j = 0; j < 8; j++)
cnt += (M[i]&(1<<j))>0;
bool flag = 0;
if (cnt > N*4 && N > 32)
send(0), send(0), send(0), send(0), flag = 1;
for (int i = 0; i < N; i++) {
if (N > 32) {
for (int j = 0; j < 4; j++) {
int id = i * 4 + j;
int val = ((M[i]&(1<<(j*2)))>0) + 2 * ((M[i]&(1<<(j*2+1)))>0);
if (flag) {
for (int k = 0; k < 3-val; k++)
send(id);
} else {
for (int k = 0; k < val; k++)
send(id);
}
}
} else {
for (int j = 0; j < 8; j++) {
int id = i * 8 + j;
int val = (M[i]&(1<<j))>0;
if (val) send(id);
}
}
}
}
#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;
void decode(int N, int L, int X[]) {
map <int,int> cnt;
for (int i = 0; i < L; i++) cnt[X[i]]++;
bool flag = 0;
for (int i = 0; i < (1<<8); i++)
if (cnt[i] >= 4) flag = 1, cnt[i] -= 4;
vector <int> ans(N);
if (flag)
for (int i = 0; i < N; i++)
ans[i] = (1<<8)-1;
for (int i = 0; i < L; i++) {
int id = X[i];
if (N > 32) {
int j = id / 4, k = id % 4;
if (flag)
ans[j] -= (1<<(k*2));
else
ans[j] += (1<<(k*2));
} else {
int j = id / 8, k = id % 8;
ans[j] += (1<<k);
}
}
for (int i = 0; i < N; i++) {
output(ans[i]);
}
}
