#include <bits/stdc++.h>
#include "encoder.h"
#include "encoderlib.h"
using namespace std;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define ll long long
#define ld long double
#define vi vector<ll>
#define si set<ll>
#define pqi priority_queue<ll>
#define pb push_back
#define watch(x) cerr << "\n" << (#x) << " is " << (x) << "\n"
#define pbds tree<ll, null_type,less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define ht cc_hash_table<ll, ll, hash<ll>>;
void encode(int N, int M[]){
int C = 0;
for (int i = 0; i < N; ++i)
{
while(M[i]){
if M[i]%2)
{
C++;
}
send(C);
M[i]/=2;
}
C+=2;
}
return;
}
#include <bits/stdc++.h>
#include "decoder.h"
#include "decoderlib.h"
using namespace std;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define ll long long
#define ld long double
#define vi vector<ll>
#define si set<ll>
#define pqi priority_queue<ll>
#define pb push_back
#define watch(x) cerr << "\n" << (#x) << " is " << (x) << "\n"
#define pbds tree<ll, null_type,less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define ht cc_hash_table<ll, ll, hash<ll>>;
void decode(int N, int L, int X[]){
sort(X, X+L);
string s = "";
for (int i = 1; i < L; ++i)
{
if (X[i]==X[i-1])
{
s += "0";
}
else if(X[i]==X[i-1]+1){
s += "1";
}
else{
int C = std::stoi(s, nullptr, 2);
output(C);
s = "";
}
}
int C = std::stoi(s, nullptr, 2);
output(C);
return;
}
