#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l)==r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif
const int MAX_N = 300010;
#include "Annalib.h"
// 11 means 1
// 10 means 0
void Anna( int N, long long X, int K, int P[] ){
vector<int> bad(N + 1000);
for (int i = 0;i < K;++i)
bad[ P[i] ] = true;
vector<int> res(N + 100);
for (int i = 0;i < N;++i) {
if (bad[i]) continue;
if ((i&1) == (X&1)) {
res[i] = true;
X>>=1;
}
}
debug(begin(res), begin(res) + N);
for (int i = 0;i < N;++i)
Set(i, res[i]);
}
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
namespace {
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l)==r], ++l; }
}
#else
#define DE(...) 0
#define debug(...) 0
#endif
const int MAX_N = 300010;
#include "Brunolib.h"
// 11 means 1
// 10 means 0
long long Bruno( int N, int A[] ){
vector<int> bit(60);
for (int i = 0, j = 0;i < N;++i) {
if (A[i] == 1) {
if (i&1) bit[j] = 1;
++j;
}
}
reverse(AI(bit));
ll X = 0;
for (int i = 0;i < 60;++i)
X = (X<<1) + bit[i];
return X;
}
