#include "grader.h"
#include "memory.h"
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<int, int> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<ld> vd;
typedef vector<long> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int MOD = 1000000007;
void play() {
vi solved(26,0),left(26,-1),right(26,-1);
FOR(i,0,25){
int a,b;
a = faceup((i*2)+1) - 'A';
b = faceup((i*2)+2) - 'A';
if(left[a] == -1)left[a] = (i*2)+1;
else right[a] = (i*2)+1;
if(left[b] == -1)left[b] = (i*2)+2;
else right[b] = (i*2)+2;
if(a==b)solved[a] = 1;
}
FOR(i,0,25){
if(solved[i])continue;
faceup(left[i]);
faceup(right[i]);
}
}
