#include <bits/stdc++.h>

// #include "workshop.h"
using namespace std;

namespace {
const int N = 1e5;
int perm[N];
const int B = 160;
const int O = 10;
int cnt = 0;

};  // namespace

void init() {
        iota(perm, perm + N, 0);
        shuffle(perm, perm + N, mt19937(123));
        for (int i = 0; i < N; i++) perm[i] %= B;
}

int morning(int my_num, int right_num) {
        return perm[my_num] * B + perm[right_num];
}

int afternoon(int left_num, int my_num, int right_num) {
        vector<int> a;
        a.emplace_back(left_num / B);
        a.emplace_back(left_num % B);
        a.emplace_back(right_num / B);
        a.emplace_back(right_num % B);
        if (a[1] == a[0] && a[1] == a[2]) {
                cnt++;
                cnt %= B;
                if (cnt == 0) cnt++;
                a[1] = (a[0] + cnt) % B;
        }
        return ((a[0] * B + a[1]) * B + a[2]) * B + a[3];
}

int evening(int left_num, int my_num, int right_num) {
        vector<int> a;
        a.emplace_back(right_num % B), right_num /= B;
        a.emplace_back(right_num % B), right_num /= B;
        a.emplace_back(right_num % B), right_num /= B;
        a.emplace_back(right_num % B), right_num /= B;
        left_num /= B;
        left_num /= B;
        a.emplace_back(left_num % B), left_num /= B;
        a.emplace_back(left_num % B), left_num /= B;
        reverse(a.begin(), a.end());
        for (int& x : a) x %= O;

        if (a[1] == a[2] && a[2] == a[3]) {
                cnt++;
                cnt %= O;
                if (cnt == 0) cnt++;
                a[2] = (a[1] + cnt) % O;
                return a[2];
        } else if (a[2] == a[3] && a[3] != a[4]) {
                cnt++;
                cnt %= O;
                if (cnt == 0) cnt++;
                a[2] = (a[1] + cnt) % O;
                if (a[2] == a[3]) (a[2] += 1) %= O;
                if (a[2] == a[1]) (a[2] += 1) %= O;
                return a[2];
        } else {
                return a[2] % O;
        }
}