// includes {{{
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<tuple>
#include<cmath>
#include<random>
#include<cassert>
#include<bitset>
#include<cstdlib>
#include<functional>
// #include<deque>
// #include<multiset>
// #include<cstring>
// #include<bits/stdc++.h>
// }}}
using namespace std;
using ll = long long;

// #undef DEBUG
// #define DEBUG
// DEBUG {{{
#include <array>
#include <deque>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <tuple>
#include <valarray>
#include <vector>
template < int n, class... T >
typename std::enable_if< (n >= sizeof...(T)) >::type __output_tuple(
    std::ostream &, std::tuple< T... > const &) {}
template < int n, class... T >
typename std::enable_if< (n < sizeof...(T)) >::type __output_tuple(
    std::ostream &os, std::tuple< T... > const &t) {
  os << (n == 0 ? "" : ", ") << std::get< n >(t);
  __output_tuple< n + 1 >(os, t);
}
template < class... T >
std::ostream &operator<<(std::ostream &os, std::tuple< T... > const &t) {
  os << "(";
  __output_tuple< 0 >(os, t);
  os << ")";
  return os;
}
template < class T, class U >
std::ostream &operator<<(std::ostream &os, std::pair< T, U > const &p) {
  os << "(" << p.first << ", " << p.second << ")";
  return os;
}
template < class T >
std::ostream &operator<<(std::ostream &os, const std::stack< T > &a) {
  os << "{";
  for(auto tmp = a; tmp.size(); tmp.pop())
    os << (a.size() == tmp.size() ? "" : ", ") << tmp.top();
  os << "}";
  return os;
}
template < class T, class Container, class Compare >
std::ostream &operator<<(std::ostream &os,
    std::priority_queue< T, Container, Compare > a) {
  os << "{ (top) ";
  while(a.size()) os << a.top() << (a.size() == 1 ? "" : ", "), a.pop();
  os << " }";
  return os;
}
template < class T, class Container >
std::ostream &operator<<(std::ostream &os, std::queue< T, Container > a) {
  os << "{ ";
  while(a.size()) os << a.front() << (a.size() == 1 ? "" : ", "), a.pop();
  os << " }";
  return os;
}
#ifdef DEBUG
#if !defined(DEBUG_OUT)
#define DEBUG_OUT std::cerr
#endif
#define dump(...)                                                                \
  [&]() {                                                                        \
    auto __debug_tap = std::make_tuple(__VA_ARGS__);                             \
    DEBUG_OUT << "[" << __LINE__ << "] " << #__VA_ARGS__ << " = " << __debug_tap \
    << std::endl;                                                      \
  }()
template < class T >
inline void dump2D(T &d, size_t sizey, size_t sizex) {
  for(size_t i = 0; i < sizey; i++) {
    DEBUG_OUT << "\t";
    for(size_t j = 0; j < sizex; j++)
      DEBUG_OUT << d[i][j] << (j + 1 == sizex ? "" : "\t");
    DEBUG_OUT << std::endl;
  }
}
template < class T >
inline void dump1D(T &d, size_t sizey) {
  for(size_t i = 0; i < sizey; i++) {
    DEBUG_OUT << d[i] << (i + 1 == sizey ? "" : " ");
  }
  DEBUG_OUT << std::endl;
}
template <
class T, class = typename std::iterator_traits< decltype(begin(T())) >::value_type,
      class = typename std::enable_if< !std::is_same< T, std::string >::value >::type >
      std::ostream &operator<<(std::ostream &os, const T &a) {
        os << "{";
        for(auto ite = begin(a); ite != end(a); ++ite)
          os << (ite == begin(a) ? "" : ", ") << *ite;
        os << "}";
        return os;
      }
#else
#define dump(...) ((void) 42)
#define dump2D(...) ((void) 42)
#define dump1D(...) ((void) 42)
template <
class T, class = typename std::iterator_traits< decltype(begin(T())) >::value_type,
      class = typename std::enable_if< !std::is_same< T, std::string >::value >::type >
      std::ostream &operator<<(std::ostream &os, const T &a) {
        for(auto ite = begin(a); ite != end(a); ++ite)
          os << (ite == begin(a) ? "" : " ") << *ite;
        return os;
      }
#endif
// }}}


// using F = function<int(ll)>;
// F def = [](ll){return 5;};

int c(vector<int> a) {
  sort(begin(a), end(a));
  a.erase(unique(begin(a), end(a)), end(a));
  size_t i = 0;
  while(i < a.size() and a[i] == i) i++;
  return i;
}

int c(int a) {
  return c({a});
}

int c(int a, int b) {
  return c({a, b});
}

int solve(ll n, ll m, int g0 = 5, int g1 = 5, int gp = 5) {
  // dump(n, m, g0, g1, gp);
  assert(n <= m);
  // grandy(m + 1) == gp
  int it = c(g0, gp);
  // grandy(m) == it
  if(n == m) return it;
  if(m % 2 == 1) {
    return solve(n, m - 1, g0, g1, it);
  } else {
    ll L = m / 2 + 1;
    int r0 = it;
    int r1 = c(g0, it);
    // grandy(m) == r0
    // grandy(m - 1) == r1
    if(n >= L) {
      return ((m - n) % 2 == 0 ? r0 : r1);
    }
    return solve(n, L - 1, r0, r1, ((m / 2) % 2 == 0) ? r1 : r0);
  }
}


// 1 2 3 4 5 6 7 8 9 0 1 2 3
// 1 0 0 2 0 2 0 1 0 1 0 1 0

int main() {
  std::ios::sync_with_stdio(false), std::cin.tie(0);
  // dump(solve(1, 14));
  // int Z = 18;
  // vector<int> f(2 * Z + 1, 5);
  // for(int i = 1; i <= Z; i++) f[i] = solve(i, Z);
  //
  // // dump(f);
  //
  // vector<int> g(2 * Z + 1, 5);
  // for(int i = Z; i >= 1; i--) g[i] = c(g[i + 1], g[i * 2]);
  // // dump(g);
  // for(int i = 1; i <= Z; i++) {
  //   if(f[i] == g[i]); else dump(i);
  //   assert(f[i] == g[i]);
  // }
  //
  //
  // dump("ok");

  // return 0;

  int k;
  cin >> k;
  int grandy = 0;
  for(int i = 0; i < k; i++) {
    ll n, m;
    cin >> n >> m;
    int g = solve(n, m, 5, 5, 5);
    grandy ^= g;
    // dump(i, g, grandy);
  }
  // 1 2 3
  // 0 1 0
  // 1 2 3 4 5 6 7 8
  // 1 0 1 2 1 0 1 0

  cout << (grandy ? "mo3tthi" : "tubuann") << endl;
  return 0;
}



Measured memory_bytes: 3220