#include "grader.h"
#include "memory.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define vl vector<ll>
#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(v) v.begin(), v.end()
#define pb push_back
#define f first
#define s second
using namespace std;
using namespace __gnu_pbds;
typedef tree<pll, null_type, less<pll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
void play()
{
char c[51];
ll i, j;
for(i = 1; i <= 50; i++)
c[i] = faceup(i);
for(i = 1; i <= 50; i++)
{
for(j = i + 1; j <= 50; j++)
{
if(c[i] == c[j])
{
faceup(i);
faceup(j);
}
}
}
}
