#include "Annalib.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
// /*
// //////////**DEFINES - START**//////////
#define ret return
#define fi first
#define se second
#define mp make_pair
#define all(x) x.begin(), x.end()
#define be(x) x.begin()
#define en(x) x.end()
#define sz(x) ll(x.size())
#define for0(i, n) for (ll i = 0; i < (n); ++i)
#define for1(i, n) for (ll i = 1; i < (n); ++i)
#define rfor0(i, n) for (ll i = (n) - 1; i >= 0; --i)
#define rfor1(i, n) for (ll i = (n) - 1; i >= 1; --i)
#define rep(i, a, n) for (ll i = a; i < ll(n); ++i)
#define rrep(i, a, n) for (ll i = a - 1; i >= ll(n); --i)
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
#define fastIO() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define con continue
#define pb push_back
#define pob pop_back
#define deb(x) cout << (#x) << " is " << (x) << endl
#define ins insert
#define len(s) (s).length()
#define gi greater<int>()
#define gll greater<ll >()
#define gstr greater<string>()
#define gpll greater<pair<ll , ll >>()
#define rast(x1, y1, x2, y2) sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2))
#define rev reverse
#define ub upper_bound
#define lb lower_bound
#define bs binary_search
#define rs resize
#define last(a) a.back()
#define co count
#define ba(a) a.back()
#define um unordered_map
#define rsun(a) a.resize(unique(a.begin(), a.end())-a.begin())
#define endl '\n'
#ifdef OG_Matveychick1
bool local = true;
#else
bool local = false;
#endif
// \\\\\\\\\\**DEFINES - END**\\\\\\\\\\
// */
// /*
// //////////**TYPEDEFS - START**//////////
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<char> vc;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef vector<string> vs;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ull> vull;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;
typedef pair<double, double> pdd;
typedef double ld;
typedef double D;
typedef vector<ld> vld;
typedef vector<pair<ld, ld>>
vpld;
typedef string str;
typedef set<ll> sll;
typedef set<int> si;
typedef set<str> ss;
typedef set<pii> spii;
typedef multiset<int> msi;
typedef multiset<ll> msll;
typedef multiset<str> mss;
typedef multiset<pii> mspii;
typedef multiset<pll> mspll;
typedef map<str, str> mps;
typedef map<int, int> mpi;
typedef map<ll, ll> mpll;
typedef map<int, vi> mpvi;
typedef map<int, vll> mpvll;
typedef map<char, int> mpci;
typedef multimap<ll, ll> mmpll;
typedef multimap<str, str> mmps;
typedef multimap<int, int> mmpi;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvll;
typedef vector<vector<long double>> vvld;
typedef vector<vvi> vvvi;
typedef vector<vector<char>> vvc;
typedef vector<vs> vvs;
typedef vector<D> vD;
typedef set<pair<ll, ll>>
spll;
typedef pair<ull, ull> pull;
typedef vector<pull> vpull;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef set<char> sc;
typedef queue<int> qi;
typedef queue<ll> qll;
typedef queue<bool> qb;
typedef vector<sll> vsll;
typedef queue<pair<ll, ll>>
qpll;
typedef vector<vector<pair<int, int>>>
vvpii;
typedef vector<vector<pair<ll, ll>>>
vvpll;
typedef vector<spll> vspll;
typedef multiset<char> msc;
typedef queue<str> qs;
typedef vector<set<int>> vsi;
typedef priority_queue<ll> pqll;
typedef vector<vsll> vvsll;
typedef pair<ld, ld> pld;
typedef vector<vvll> vvvll;
typedef set<ld> sld;
typedef vector<vpld> vvpld;
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
ordered_set;
typedef tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update>
ordered_multiset;
const ll C = 60;
const vll S{1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1,
0, 0, 1, 1,
0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0};
const vll F{81, 109, 35, 3, 82, 98, 124, 146, 16, 32, 44, 116, 33, 89, 36, 107, 135, 62, 15, 42, 95, 77, 18, 105, 143,
96, 104, 118,
128, 58, 54, 9, 110, 1, 133, 112, 93, 127, 71, 4, 140, 101, 43, 38, 142, 72, 85, 84, 57, 26, 28, 100, 29,
115, 113, 6,
144, 75, 11, 67, 123, 14, 46, 137, 31, 64, 76, 48, 111, 61, 78, 92, 94, 83, 17, 120, 30, 56, 139, 50, 65,
97, 90, 136, 53, 131, 147, 60, 37, 68, 34, 7, 87, 74, 47, 51, 20, 24, 117, 49, 145, 138, 2, 79, 80, 0, 27,
121, 39, 86, 5, 23, 130, 125, 12, 134, 126, 102, 132, 63, 40, 141, 19, 10, 88, 119, 45, 108, 103, 8, 129,
148, 66, 149, 99, 59, 73, 55, 122, 21, 52, 106, 91, 13, 69, 25, 70, 114, 41, 22};
void Anna(int N, long long X, int K, int P[]) {
vvll dp[2][2];
dp[0][0] = {{1, 0, 0}};
dp[0][1] = {{1, 1, 1},
{0, 1, 1}};
dp[1][0] = {{1, 1, 0},
{0, 0, 1}};
dp[1][1] = {{1, 0, 1},
{0, 1, 0}};
vll a;
for0(i, C) a.pb(((X >> i) & 1) ^ S[i]);
ll i = 0, j = 0;
vll ans(N), used(N);
for0(c, K) used[P[c]] = 1;
while (i < N && j < C) {
ll x = a[j], y = a[j + 1];
for (auto v: dp[x][y]) {
bool fl = 1;
for0(c, 3) {
if (v[c] && used[F[i + c]]) fl = 0;
}
if (fl) {
for0(c, 3) {
if (v[c]) ans[F[i + c]] = 1;
}
j += 2;
break;
}
}
i += 3;
}
for0(c, N) Set(c, ans[c]);
}
#include "Brunolib.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
// /*
// //////////**DEFINES - START**//////////
#define ret return
#define fi first
#define se second
#define mp make_pair
#define all(x) x.begin(), x.end()
#define be(x) x.begin()
#define en(x) x.end()
#define sz(x) ll(x.size())
#define for0(i, n) for (ll i = 0; i < (n); ++i)
#define for1(i, n) for (ll i = 1; i < (n); ++i)
#define rfor0(i, n) for (ll i = (n) - 1; i >= 0; --i)
#define rfor1(i, n) for (ll i = (n) - 1; i >= 1; --i)
#define rep(i, a, n) for (ll i = a; i < ll(n); ++i)
#define rrep(i, a, n) for (ll i = a - 1; i >= ll(n); --i)
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
#define fastIO() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define con continue
#define pb push_back
#define pob pop_back
#define deb(x) cout << (#x) << " is " << (x) << endl
#define ins insert
#define len(s) (s).length()
#define gi greater<int>()
#define gll greater<ll >()
#define gstr greater<string>()
#define gpll greater<pair<ll , ll >>()
#define rast(x1, y1, x2, y2) sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2))
#define rev reverse
#define ub upper_bound
#define lb lower_bound
#define bs binary_search
#define rs resize
#define last(a) a.back()
#define co count
#define ba(a) a.back()
#define um unordered_map
#define rsun(a) a.resize(unique(a.begin(), a.end())-a.begin())
#define endl '\n'
// \\\\\\\\\\**DEFINES - END**\\\\\\\\\\
// */
// /*
// //////////**TYPEDEFS - START**//////////
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<char> vc;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef vector<string> vs;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ull> vull;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;
typedef pair<double, double> pdd;
typedef double ld;
typedef double D;
typedef vector<ld> vld;
typedef vector<pair<ld, ld>>
vpld;
typedef string str;
typedef set<ll> sll;
typedef set<int> si;
typedef set<str> ss;
typedef set<pii> spii;
typedef multiset<int> msi;
typedef multiset<ll> msll;
typedef multiset<str> mss;
typedef multiset<pii> mspii;
typedef multiset<pll> mspll;
typedef map<str, str> mps;
typedef map<int, int> mpi;
typedef map<ll, ll> mpll;
typedef map<int, vi> mpvi;
typedef map<int, vll> mpvll;
typedef map<char, int> mpci;
typedef multimap<ll, ll> mmpll;
typedef multimap<str, str> mmps;
typedef multimap<int, int> mmpi;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvll;
typedef vector<vector<long double>> vvld;
typedef vector<vvi> vvvi;
typedef vector<vector<char>> vvc;
typedef vector<vs> vvs;
typedef vector<D> vD;
typedef set<pair<ll, ll>>
spll;
typedef pair<ull, ull> pull;
typedef vector<pull> vpull;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef set<char> sc;
typedef queue<int> qi;
typedef queue<ll> qll;
typedef queue<bool> qb;
typedef vector<sll> vsll;
typedef queue<pair<ll, ll>>
qpll;
typedef vector<vector<pair<int, int>>>
vvpii;
typedef vector<vector<pair<ll, ll>>>
vvpll;
typedef vector<spll> vspll;
typedef multiset<char> msc;
typedef queue<str> qs;
typedef vector<set<int>> vsi;
typedef priority_queue<ll> pqll;
typedef vector<vsll> vvsll;
typedef pair<ld, ld> pld;
typedef vector<vvll> vvvll;
typedef set<ld> sld;
typedef vector<vpld> vvpld;
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
ordered_set;
typedef tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update>
ordered_multiset;
// \\\\\\\\\\**TYPEDEFS - END**\\\\\\\\\\
// */
// /*
// //////////**CONSTANTS - START**//////////
const ld pi = acosl(-1);
const ll mod1 = 1e9 + 7;
const ll mod2 = 998244353;
const ll MAXLL = 9223372036854775807;
//const ll MAXINT = 2147483647;
const ld eps = 1e-6;
// \\\\\\\\\\**CONSTANTS - END**\\\\\\\\\\
// */
// /*
// //////////**TEMPLATES - START**//////////
template<typename T>
istream &operator>>(istream &in, vector<T> &a) {
for (T &i: a) in >> i;
return in;
}
template<typename T1, typename T2>
istream &operator>>(istream &in, pair<T1, T2> &a) {
in >> a.fi >> a.se;
return in;
}
template<typename T1, typename T2>
ostream &operator<<(ostream &out, pair<T1, T2> &a) {
out << a.fi << " " << a.se;
return out;
}
template<typename T1, typename T2>
istream &operator>>(istream &in, vector<pair<T1, T2>>
&a) {
for (
pair<T1, T2> &i
: a)
in >> i.fi >> i.
se;
return
in;
}
template<typename T>
ostream &operator<<(ostream &out, const vector<T> &a) {
for (auto i: a) {
out << i << " ";
}
return out;
}
template<typename T1, typename T2>
ostream &operator<<(ostream &out, vector<pair<T1, T2>>
&a) {
for (
pair<T1, T2> i
: a)
out << i.fi << " " << i.se <<
endl;
return
out;
}
template<typename T1>
ostream &operator<<(ostream &out, vector<vector<T1>> &a) {
for (vector<T1> i: a) {
for (T1 j: i) out << j << " ";
out << endl;
}
return out;
}
template<typename T1, typename T2>
inline T1 min(T1 a, T2 b) {
b = (T1) b;
return a > b ? b : a;
}
template<typename T1, typename T2>
inline T1 max(T1 a, T2 b) {
b = (T1) b;
return a > b ? a : b;
}
template<typename T1, typename T2>
inline void amin(T1 &a, T2 b) {
a = min(a, b);
}
template<typename T1, typename T2>
inline void amax(T1 &a, T2 b) {
a = max(a, b);
}
// \\\\\\\\\\**TEMPLATES - END**\\\\\\\\\\
// */
// This bear is a good alternative to duck!!!
/*
???? ??????
???????????????????
???????????????? ???
??? ??????????? ???
??? ???????????? ??
??????????????????
??????????????? ?
?????????????????
??????? ??? ??
???? ??????????
???? ?? ???
???????????? ?????
????????????????????
???????? ?? ???????
??????? ?????
*/
const ll C = 60;
const vll S{1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1,
0, 0, 1, 1,
0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0};
const vll F{81, 109, 35, 3, 82, 98, 124, 146, 16, 32, 44, 116, 33, 89, 36, 107, 135, 62, 15, 42, 95, 77, 18, 105, 143,
96, 104, 118,
128, 58, 54, 9, 110, 1, 133, 112, 93, 127, 71, 4, 140, 101, 43, 38, 142, 72, 85, 84, 57, 26, 28, 100, 29,
115, 113, 6,
144, 75, 11, 67, 123, 14, 46, 137, 31, 64, 76, 48, 111, 61, 78, 92, 94, 83, 17, 120, 30, 56, 139, 50, 65,
97, 90, 136, 53, 131, 147, 60, 37, 68, 34, 7, 87, 74, 47, 51, 20, 24, 117, 49, 145, 138, 2, 79, 80, 0, 27,
121, 39, 86, 5, 23, 130, 125, 12, 134, 126, 102, 132, 63, 40, 141, 19, 10, 88, 119, 45, 108, 103, 8, 129,
148, 66, 149, 99, 59, 73, 55, 122, 21, 52, 106, 91, 13, 69, 25, 70, 114, 41, 22};
long long Bruno(int N, int A[]) {
vvll dp[2][2];
dp[0][0] = {{1, 0, 0}};
dp[0][1] = {{1, 1, 1},
{0, 1, 1}};
dp[1][0] = {{1, 1, 0},
{0, 0, 1}};
dp[1][1] = {{1, 0, 1},
{0, 1, 0}};
vll a;
ll i = 0;
while (i < N) {
if (A[F[i]] || A[F[i + 1]] || A[F[i + 2]]) {
vll c{A[F[i]], A[F[i + 1]], A[F[i + 2]]};
for0(x, 2) {
for0(y, 2) {
for (auto v: dp[x][y]) {
if (v == c) a.pb(x), a.pb(y);
}
}
}
}
i += 3;
}
ll ans = 0;
for0(c, C) ans += (1ll << c) * (a[c] ^ S[c]);
ret ans;
}
