#include<bits/stdc++.h>
#include"Annalib.h"
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=4e5+5;
const ll K=350;
const ld pi=3.14159265359;
const ll INF=(1LL<<40);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()
void Anna(int n,ll x,int k,int *p){
bool vis[200];
REP(i,200)vis[i]=1;
ll ti=0;
REP(i,k)vis[p[i]]=0;
for(int i=0;i<n;i++){
if(vis[i]||i+2>=n||ti>=60||vis[i+1]<(bool)(x&(1LL<<(ti+1)))||vis[i+2]<(bool)(x&(1LL<<(ti+2)))){
Set(i,0);continue;
}
Set(i,1);
Set(i+1,(bool)(x&(1LL<<(ti+1))));
Set(i+2,(bool)(x&(1LL<<(ti+2))));
ti+=2;i+=2;
}
}
#include<bits/stdc++.h>
#include"Brunolib.h"
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=4e5+5;
const ll K=350;
const ld pi=3.14159265359;
const ll INF=(1LL<<40);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()
ll Bruno(int n,int *A){
ll ti=0,ans=0;
for(int i=0;i<n;i++){
if(A[i]==1){
ans|=(A[i+1]*(1LL<<ti));ti++;
ans|=(A[i+2]*(1LL<<ti));ti++;
i+=2;
}
}
return ans;
}
