#include <bits/stdc++.h>
using namespace std;
#include "Annalib.h"
void Anna (int N, long long X, int K, int P[]) {
bool fuc[N+5], init;
int pre[N+5], b;
string rep[4] = {"100110101001101010101001100110010110100101010110011001011010100101010110011010101010101010100110010101011001100110101001100101100101010101101010100101", "010101101010010110100110101010101010100101010101101001010101010101011010101001011001101010011010011001011001100110010110011010010101010101010110100110", "01001000001000010100001000010100010000010010010000010010001001000100000100010001010001000010100000011000100010000100100010000010001000010100", "01111101110110111011101111101110101110111011111010111011011111100111011111100111011111100111111010111101110111011110011101111011110101111011"};
memset(fuc, 1, sizeof fuc);
for (int i = 0; i < K; i++) fuc[P[i]] = 0;
for (int s = 0; s < 4; s++) {
init = 0;
b = 0;
for (int i = 0; i < N; i++) {
if (!fuc[i]) pre[i] = 0;
else if (!init && i % 4 == s) pre[i] = 1, init = 1;
else if (!init) pre[i] = 0;
else if (b == 60) pre[i] = 0;
else if (((1ll << b) & X) == 0 && rep[s][i % (int)rep[s].length()] == '1') pre[i] = 0;
else if (((1ll << b) & X) > 0 && rep[s][i % (int)rep[s].length()] == '0') pre[i] = 0;
else pre[i] = 1, b++;
}
if (b == 60) {
for (int i = 0; i < N; i++) Set(i, pre[i]);
return;
}
}
for (int i = 0; i < N; i++) Set(i, pre[i]);
}
#include <bits/stdc++.h>
using namespace std;
#include "Brunolib.h"
long long Bruno (int N, int A[]) {
string rep[4] = {"100110101001101010101001100110010110100101010110011001011010100101010110011010101010101010100110010101011001100110101001100101100101010101101010100101", "010101101010010110100110101010101010100101010101101001010101010101011010101001011001101010011010011001011001100110010110011010010101010101010110100110", "01001000001000010100001000010100010000010010010000010010001001000100000100010001010001000010100000011000100010000100100010000010001000010100", "01111101110110111011101111101110101110111011111010111011011111100111011111100111011111100111111010111101110111011110011101111011110101111011"};
long long V = 0;
int s = -1;
int b = 0;
for (int i = 0; i < N; i++) {
if (A[i] == 1) {
if (s == -1) s = i % 4;
else if (rep[s][i % (int)rep[s].length()] == '1') V += (1ll << b), b++;
else b++;
}
}
return V;
}
