#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF=1e9,MOD=1e9+7,ohara=1e6+10;
const ll LINF=1e18;
using namespace std;
    
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(int i=(a);i<(b);i++)
#define rrrep(i,a,b) for(int i=(a);i>=(b);i--)
#define all(v) (v).begin(), (v).end()
#define Size(n) (n).size()
#define Cout(x) cout<<(x)<<endl
#define doublecout(a) cout<<fixed<<setprecision(15)<<a<<endl;
#define Cerr(x) cerr<<(x)<<endl
#define fi first
#define se second
#define P pair<ll,ll> 
#define m_p make_pair
#define V vector<ll> 
#define U_MAP unordered_map<ll,ll>
#define pq priority_queue<ll>
#define rpq priority_queue<ll,vector<ll>,greater<ll>>
#define p_b push_back
    
ll n,cnt,ans,a,b,c,d,tmp,tmpp,m,h,w,x,y,sum,pos,k,q;
ld doua;
int dy[]={1,0,-1,0};
int dx[]={0,1,0,-1};
//int dy[]={-1,0,1,-1,1,-1,0,1};
//int dx[]={-1,-1,-1,0,0,1,1,1};
string alph("abcdefghijklmnopqrstuvwxyz"),s;
bool fl;
struct edge{int to,cost;};
ll dat[ohara];
    
//------ Believe yourself as a genius!!!!!! ------
    
int main(void){
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(false);
    
    cin>>k;
    rep(i,k){
        cin>>n>>m;
        ll hasi=m/2;
        ll ki,gu;
        if(m%2==0){
            gu=0;
            ki=1;
        }
        else{
            ki=0;
            gu=1;
        }
        while(1){
            if(hasi<n)break;
            int vi1[10]={};
            int vi2[10]={};
            if(hasi%2==1){
                vi1[gu]++;
                rep(j,3){
                    if(vi1[j]==0){
                        ki=j;
                        break;
                    }
                }
                vi2[ki]++;
                vi2[gu]++;
                rep(j,3){
                    if(vi2[j]==0){
                        gu=j;
                        break;
                    }
                }
            }
            else{
                vi1[gu]++;
                vi2[gu]++;
                vi1[ki]++;
                rep(j,3){
                    if(vi1[j]==0){
                        gu=j;
                        break;
                    }
                }
                vi2[gu]++;
                rep(j,3){
                    if(vi2[j]==0){
                        ki=j;
                        break;
                    }
                }
            }
            //cout<<hasi<<" "<<gu<<" "<<ki<<"\n";
            hasi/=2;
        }
        if(n%2==1)dat[i]=ki;
        else dat[i]=gu;
    }
    ans=dat[0];
    rrep(i,1,k){
        ans=(ans xor dat[i]);
    }
    if(ans==0)Cout("tubuann");
    else Cout("mo3tthi");
    return 0;
}
