#include "Annalib.h"
#include <bits/stdc++.h>
#define pb push_back
#define all(v) ((v).begin(), (v).end())
#define sortv(v) sort(all(v))
#define sz(v) ((int)(v).size())
#define uniqv(v) (v).erase(unique(all(v)), (v).end())
#define umax(a, b) (a)=max((a), (b))
#define umin(a, b) (a)=min((a), (b))
#define FOR(i,a,b) for(int i = (a); i <= (b); i++)
#define rep(i,n) FOR(i,1,n)
#define rep0(i,n) FOR(i,0,(int)(n)-1)
#define FI first
#define SE second
#define INF 2000000000
#define INFLL 1000000000000000000LL
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAX_N = 150;
bool chk[MAX_N+1];
void Anna( int N, long long X, int K, int P[]){
for(int i=0; i<N; i++) chk[i] = false;
for(int i=0; i<K; i++){
chk[P[i]] = true;
}
for(int i = 0; i < N; i+=2){
if(chk[i] || chk[i+1]) continue;
if(X%(ll)3==0){
Set(i, 1);
Set(i+1, 1);
}else if(X%(ll)3==1){
Set(i, 1);
Set(i+1, 0);
}else{
Set(i, 0);
Set(i+1, 1);
}
X/=(ll)3;
}
}
#include "Brunolib.h"
#include <bits/stdc++.h>
#define pb push_back
#define all(v) ((v).begin(), (v).end())
#define sortv(v) sort(all(v))
#define sz(v) ((int)(v).size())
#define uniqv(v) (v).erase(unique(all(v)), (v).end())
#define umax(a, b) (a)=max((a), (b))
#define umin(a, b) (a)=min((a), (b))
#define FOR(i,a,b) for(int i = (a); i <= (b); i++)
#define rep(i,n) FOR(i,1,n)
#define rep0(i,n) FOR(i,0,(int)(n)-1)
#define FI first
#define SE second
#define INF 2000000000
#define INFLL 1000000000000000000LL
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
long long Bruno( int N, int A[] ){
ll ans = 0;
ll thr = 1;
for(int i=0; i<N; i+=2){
if(A[i]==0 && A[i+1]==0) continue;
if(A[i]==1 && A[i+1]==0){
ans += 1 * thr;
}else if(A[i]==0 && A[i+1]==1){
ans += 2 * thr;
}
thr*=(ll)3;
}
return ans;
}
