#include <bits/stdc++.h>
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"

#define NDEBUG
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
using uint = unsigned int;
using usize = std::size_t;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template<typename T> constexpr T popcount(const T u) { return u ? static_cast<T>(__builtin_popcountll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T log2p1(const T u) { return u ? static_cast<T>(64 - __builtin_clzll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T msbp1(const T u) { return log2p1(u); }
template<typename T> constexpr T lsbp1(const T u) { return __builtin_ffsll(u); }
template<typename T> constexpr T clog(const T u) { return u ? log2p1(u - 1) : static_cast<T>(u); }
template<typename T> constexpr bool ispow2(const T u) { return u and (static_cast<u64>(u) & static_cast<u64>(u - 1)) == 0; }
template<typename T> constexpr T ceil2(const T u) { return static_cast<T>(1) << clog(u); }
template<typename T> constexpr T floor2(const T u) { return u == 0 ? static_cast<T>(0) : static_cast<T>(1) << (log2p1(u) - 1); }
template<typename T> constexpr bool btest(const T mask, const usize ind) { return ((static_cast<u64>(mask) >> ind) & static_cast<u64>(1)); }
template<typename T> constexpr T bcut(const T mask, const usize ind) { return ind == 0 ? static_cast<T>(0) : static_cast<T>((static_cast<u64>(mask) << (64 - ind)) >> (64 - ind)); }
template<typename T> bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); }
template<typename T> bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); }
constexpr unsigned int mod                  = 1000000007;
template<typename T> constexpr T inf_v      = std::numeric_limits<T>::max() / 4;
template<typename Real> constexpr Real pi_v = Real{3.141592653589793238462643383279502884};
template<typename T>
T read()
{
    T v;
    return std::cin >> v, v;
}
template<typename T>
std::vector<T> read_vec(const std::size_t size)
{
    std::vector<T> v(size);
    for (auto& e : v) { std::cin >> e; }
    return v;
}
template<typename... Types>
auto read_vals() { return std::tuple<std::decay_t<Types>...>{read<Types>()...}; }
#define SHOW(...) static_cast<void>(0)
template<typename T>
std::vector<T> make_v(const std::size_t size, T v) { return std::vector<T>(size, v); }
template<class... Args>
auto make_v(const std::size_t size, Args... args) { return std::vector<decltype(make_v(args...))>(size, make_v(args...)); }
usize mex() { return 0; }
usize mex(const usize x) { return x == 0 ? 1 : 0; }
usize mex(const usize x, const usize y)
{
    std::set<usize> s{x, y};
    for (usize i = 0; i < 3; i++) {
        if (s.find(i) == s.end()) { return i; }
    }
    return 10;
}
int main()
{
    auto solve = [&](const ll m, const ll n) -> ll {
        if (m == 1) { return n == 0 ? 1 : 0; }
        SHOW(m, n);
        std::vector<ll> l{m + 1};
        std::vector<std::vector<usize>> g{{0}, {0}};
        for (;;) {
            const ll nr = l.back() - 1LL, nl = (l.back() + 1LL) / 2;
            l.push_back(nl);
            if (nr == m) {
                g[m % 2].push_back(0), g[(m - 1) % 2].push_back(1);
                continue;
            }
            const usize pe = g[0].back();
            g[nr % 2].push_back(mex(g[(nr - 1) % 2].back(), pe));
            if (nr > nl) {
                g[(nr - 1) % 2].push_back(mex(pe, g[nr % 2].back()));
            } else {
                g[(nr - 1) % 2].push_back(10);
            }
            if (nl <= 1) { break; }
        }
        usize inf = 0, sup = l.size();
        while (sup - inf > 1) {
            const auto mid           = (inf + sup) / 2;
            (l[mid] > n ? inf : sup) = mid;
        }
        SHOW(l, g);
        SHOW(inf, sup);
        return g[n % 2][sup];
    };
    const auto k = read<usize>();
    usize x      = 0;
    for (usize i = 0; i < k; i++) {
        const auto n = read<ll>(), m = read<ll>();
        const usize s = solve(m, n);
        SHOW(s), x ^= s;
    }
    std::cout << (x == 0 ? "tubuann" : "mo3tthi") << std::endl;
    return 0;
}



Measured memory_bytes: 3168