#include "bits/stdc++.h"
#define YES "YES"
#define NO "NO"
#define YESNO OUT(three(solve(),YES,NO))
#define ECHO OUT(solve())
#define three(A,B,C) ((A)?(B):(C))
#define FOR(i,a,b)  for(LL i=(a);i< (LL)(b);i++)
#define EFOR(i,a,b) for(LL i=(a);i<=(LL)(b);i++)
#define RFOR(i,a,b) for(LL i=(b);i>=(LL)(a);i--)
#define REP(i,b) FOR(i,zero,b)
#define rep REP
#define EREP(i,b) EFOR(i,zero,b)
#define RREP(i,b) RFOR(i,b,zero)
#define ALL(c) c.begin(),c.end()
#define UNIQUE(c) sort(ALL(c));c.erase(unique(ALL(c)),c.end())
#define MAX(c) (*max_element(ALL(c)))
#define MIN(c) (*min_element(ALL(c)))
#define MP make_pair
#define FI first
#define SE second
#define SI(x) (LL(x.size()))
#define PB push_back
#define DEBUG(a) OUT(a)
#define DEBUG2(a,b) OUT2(a,b)
#define cat cout << __LINE__ << endl
#define OUT(a) cout << (a) << endl
#define OUT2(a,b) cout << (a) <<" "<<(b) << endl
#define zero 0LL
#define all ALL
#define pb emplace_back
#define eb pb
#define int long long
using namespace std;
template<typename T> inline void maximize(T &a, T b) { a = max(a, b); }
template<typename T> inline void minimize(T &a, T b) { a = min(a, b); }
template<typename T> inline bool middle(T a, T b, T c) { return b <= a && a <= c; }
template<class T> inline bool MX(T &l, const T &r) { return l < r ? l = r, 1 : 0; }
template<class T> inline bool MN(T &l, const T &r) { return l > r ? l = r, 1 : 0; }
typedef int LL;
typedef double ld;
typedef int ut;
typedef vector<ut> VI;
typedef vector<VI> VII;
typedef pair<ut, ut> pr;
typedef pair<ut, pr> ppr;
typedef vector<pr> Vpr;
typedef vector<ppr> Vppr;
typedef tuple<int, int, int, int> tapu;
typedef vector<tapu> Vtapu;
typedef priority_queue<tapu, Vtapu, greater<tapu> > PQ;
inline void outputVI(VI x) { REP(i, SI(x)) { cout << three(i, " ", "") << x[i]; }OUT(""); }
const int SIZE1 = 3e5 + 1000;
const int SIZE2 = 5010;
const int SIZE3 = 430;
const int SIZE = SIZE1;
const int MAPSIZE = 40;
const LL p = 7 + 1e9;
const LL INF = 1LL << 60;
const long double EPS = 1e-7;
typedef pair<ld, ut> pld;
 
LL DP[500][500];
bool checked[500][500];
LL zikken(LL n,LL m){
  if(n>m) return INF;
  if(checked[n][m]) return DP[n][m];
  checked[n][m]=true;
  if(zikken(n*2,m) and zikken(n+1,m)) return DP[n][m]=0;
  if(zikken(n*2,m)==1 or zikken(n+1,m)==1) return DP[n][m]=2;
  return DP[n][m]=1;
}
LL f(int a,int b){
  if(a and b)return 0;
  if(a==1 or b==1) return 2;
  return 1;
}
LL solve(LL n,LL m,LL mval,LL otherval){
  //cout << n << m << " " << mval <<" " <<otherval<<endl;
  if(n*2>m){
    if((m-n)%2) return otherval;
    else return mval;
  }
  if(m%2){
    if(m/2%2==0)
      return solve(n,m/2,f(otherval,mval),f(f(otherval,mval),otherval));
    else
      return solve(n,m/2,f(otherval,otherval),f(otherval,f(otherval,otherval)));
  }
  else{
    if(m/2%2==0)
      return solve(n,m/2,f(otherval,mval),f(f(otherval,mval),mval));
    else
      return solve(n,m/2,f(mval,mval),f(f(mval,mval),mval));
  }
}
signed main(){
  LL N,M,K;
  LL grundy=0;
  //cin >> M ;
 /* EFOR(M,1,100)
    EFOR(i,2,M){
       if(i%8==1) cout << " ";
       cout << zikken(i,M);
       cout << M << " " << i<< " " << zikken(i,M) << " " << solve(i,M,0,1) << endl;
      assert(zikken(i,M)==solve(i,M,0,1));
    }
  cout << endl;*/
  cin >> K;
  REP(i,K){
    cin >> N >> M;
    LL c=solve(2,M,0,1);
    if(N==1 and M==1);
    if(N==1) grundy^=f(c,c);
    else grundy^=solve(N,M,0,1);
  }
  if(grundy) cout << "mo3tthi" << endl;
  else cout << "tubuann" << endl;
 
  return 0;
}



Measured memory_bytes: 3120