// Is the judge avaliable ???
// from penguinman
#include "workshop.h"

#include <bits/stdc++.h>

using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
using ll = int;
using vi = vector<ll>;
using vii = vector<vi>;
using pii = std::pair<ll,ll>;

#define rep(i,j,k) for(ll i=ll(j); i<ll(k); i++)
#define REP(i,j,k) for(ll i=ll(j); i<=ll(k); i++)
#define per(i,j,k) for(ll i=ll(j); i>=ll(k); i--)
#define ln "\n"
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define mp std::make_pair
#define mtp std::make_tuple

void init() { }

int f(int x, int y){
    constexpr int LOG = 20;
    rep(i,0,LOG){
        ll a = (x & (1<<i));
        ll b = (y & (1<<i));
        if(a != b){
            int ret = i*2;
            if(a) ret++;
            return ret;
        }
    }
}

int morning(int my_num, int right_num) {
    return f(my_num, right_num);
}

int afternoon(int left_num, int my_num, int right_num) {
    return f(f(left_num, my_num), f(my_num, right_num));
}

int evening(int left_num, int my_num, int right_num) {
    return f(f(left_num, my_num), f(my_num, right_num));
}