#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "coins.h"
int neutral = 63;
int flip3(VI a, int c) {
if (c == 0) {
if (a == VI{0, 0, 0}) return 0;
if (a == VI{0, 0, 1}) return 1;
if (a == VI{0, 1, 0}) return 2;
if (a == VI{0, 1, 1}) return neutral;
if (a == VI{1, 0, 0}) return neutral;
if (a == VI{1, 0, 1}) return 2;
if (a == VI{1, 1, 0}) return 1;
if (a == VI{1, 1, 1}) return 0;
}
if (c == 1) {
if (a == VI{0, 0, 0}) return 1;
if (a == VI{0, 0, 1}) return 0;
if (a == VI{0, 1, 0}) return neutral;
if (a == VI{0, 1, 1}) return 2;
if (a == VI{1, 0, 0}) return 2;
if (a == VI{1, 0, 1}) return neutral;
if (a == VI{1, 1, 0}) return 0;
if (a == VI{1, 1, 1}) return 1;
}
if (c == 2) {
if (a == VI{0, 0, 0}) return 2;
if (a == VI{0, 0, 1}) return neutral;
if (a == VI{0, 1, 0}) return 0;
if (a == VI{0, 1, 1}) return 1;
if (a == VI{1, 0, 0}) return 1;
if (a == VI{1, 0, 1}) return 0;
if (a == VI{1, 1, 0}) return neutral;
if (a == VI{1, 1, 1}) return 2;
}
return -1;
}
int makeeq(VI a) {
if (a == VI{0, 0, 0}) return neutral;
if (a == VI{0, 0, 1}) return 2;
if (a == VI{0, 1, 0}) return 1;
if (a == VI{0, 1, 1}) return 0;
if (a == VI{1, 0, 0}) return 0;
if (a == VI{1, 0, 1}) return 1;
if (a == VI{1, 1, 0}) return 2;
if (a == VI{1, 1, 1}) return neutral;
return -1;
}
VI coin_flips(VI b, int c) {
VI ret;
auto set1 = [&](int ind) {if (b[ind] == 0) ret.pb(ind);};
auto set0 = [&](int ind) {if (b[ind] == 1) ret.pb(ind);};
VI a = {b[0], b[1], b[2]};
if (c < 3) {
ret.pb(flip3(a, c));
} else {
ret.pb(makeeq(a));
replr(i, 0, 5) {
if (c & (1<<i)) {
set1(3+i);
} else {
set0(3+i);
}
}
}
/*for (int x : ret) cout << x << " "; cout << endl;*/
return ret;
}
int find_coin(VI b) {
if (b[0] == b[1] && b[0] == b[2]) {
int x = 0;
replr(i, 0, 5) if (b[3+i]) {
x += 1 << i;
}
return x;
}
if (b[0] == b[1]) return 2;
if (b[0] == b[2]) return 1;
if (b[1] == b[2]) return 0;
return -1;
}
