#include "workshop.h"
#include<bits/stdc++.h>
#define ll long long
#define pll pair<ll, ll>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ld long double
#define sz(a) ((ll)(a).size())
using namespace std;

const ll maxn=100005;
ll a[maxn], b[maxn], c[maxn];

void init() 
{
    for (ll i=0, cr=0; i<maxn; i++)
    {
        while (__builtin_popcount(cr)!=10) cr++;
        a[i]=cr++;
    }
    for (ll i=0, cr=0; i<20; i++)
    {
        while (__builtin_popcount(cr)!=3) cr++;
        b[i]=cr++;
    }
    for (ll i=0, cr=0; i<6; i++)
    {
        while (__builtin_popcount(cr)!=2) cr++;
        c[i]=cr++;
    }
}

int morning(int my_num, int right_num) 
{ 
    for (ll i=0; i<20; i++)
        if ((a[my_num]&1<<i) && !(a[right_num]&1<<i))
            return b[i];
    assert(0);
}

int merge(int a, int b)
{
    for (ll i=0; i<6; i++)
        if ((a&1<<i) && !(b&1<<i))
            return c[i];
    assert(0);
}

int afternoon(int left_num, int my_num, int right_num) 
{ 
    tie(my_num, right_num)=mp(merge(left_num, my_num), merge(my_num, right_num));
    for (ll i=0; i<4; i++)
        if ((my_num&1<<i) && !(right_num&1<<i))
            return i;
    assert(0);
}

int evening(int left_num, int my_num, int right_num) 
{ 
    if (my_num<3) return my_num;
    for (ll i=0; i<2; i++)
        if (left_num!=i && right_num!=i)
            return i;
    assert(0);
}