#include "workshop.h"

#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


inline int bsr(int x) {
  return 31 - __builtin_clz(x);
}

int solve(int a, int b) {
  assert(a != b);
  const int e = bsr(a ^ b);
  return e << 1 | (a >> e & 1);
}

int smart(int a, int b, int c) {
  const int e = bsr(a ^ b);
  const int f = bsr(b ^ c);
  return (e == f) ? (a >> e & 1) : (2 + e);
}


void init() {
  
}

int morning(int my_num, int right_num) {
  const int ret = solve(my_num, right_num);
  return ret;
}

int afternoon(int left_num, int my_num, int right_num) {
  const int ret = smart(left_num, my_num, right_num);
  return ret;
}

int evening(int left_num, int my_num, int right_num) {
  const int ret = smart(left_num, my_num, right_num);
  return ret;
}