#include <bits/stdc++.h>

#define     boost            ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);	
#define     pb               push_back	
#define     pob              pop_back	
#define     pof              pop_front	
#define     pf               push_front
#define     mp               make_pair
#define     ff               first
#define     ss               second
#define     endl             "\n"

#define     rep(i,a,b)       for(ll i=a; i<b; i++)
#define     rev(i,a,b)       for(ll i=a; i>=b; i--)

#define     decimal(n)       fixed << setprecision(n) 
#define     all(v)           v.begin(), v.end() 
#define     rall(v)          v.rbegin(), v.rend()
#define     sz(v)            v.size()
#define     total_sum(v)     accumulate(all(v),0)  

#define     make_unique(v)   v.erase(unique(all(v)),v.end())
#define     n_p(v)           next_permutation(all(v))
#define     p_p(v)           prev_permutation(all(v))
	

#define     for_each(it, X)  for(__typeof((X).begin()) it = (X).begin(); it != (X).end(); it++)


#define     re               return

using namespace std;

typedef     long long              ll;
typedef     unsigned long long     ull;
typedef     pair < int, int >      pii;
typedef     pair < ll, ll >        pll;
typedef     vector < pii >         vii;
typedef     vector < pll >         vll;
typedef     vector < int >         vi;
typedef     vector < ll >          vl;
typedef     vector < string >      vs;


ll gcd ( ll , ll );

ll lcm ( ll  , ll );

bool isPrime( ll );

ll power( ll , ll );

ll fact( ll );

void sieve_of_eratosthenes ( ll , vl &a); 


//---------------------------------------------------------------------------------------------------------------------------------------------
//---------------------------------------------------------------------------------------------------------------------------------------------

void solve()
{
	ll a,b,c;
	cin>>a>>b>>c;
	
	if(c) {
		
		if(b<=a) {
			c=1;
		}
		
		else
		c=0;	
		
	}
	
	else {
		if(a<=b) {
			c=0;
		}
		
		else
		c=1;
	}
	
	if(c) {
		cout<<"Takahashi";
	}
	
	else
	cout<<"Aoki";
}
 
int main()
{
    boost;
    ll t=1;
//	cin>>t;
    
	while(t--)
    {
    	solve();
    }
  
}

//---------------------------------------------------------------------------------------------------------------------------------------------
//---------------------------------------------------------------------------------------------------------------------------------------------

// HCF

ll gcd ( ll a , ll b )  {
	
	return __gcd ( a , b ) ;
	
	/*
	
	if ( a==0 )
	return b ;
	
	return gcd ( b%a , a ) ;	
	
	*/
}

// LCM

ll lcm ( ll a , ll b )  {
	
	return ( a * b ) / ( __gcd ( a , b ) ) ;

}

// PRIME 

bool isPrime( ll n )
{
    ll i=2;
    
    for( i ; i*i<=n ; i++) 
	{
        if( n % i == 0)
        return false;
    }
    
    return true;
}

// POWER

ll power( ll b , ll a ) {
	
	if(a==0) {
		return 1;
	}
	
	ll c=1;
	
	rep(i,0,a) {
		c*=b;
	}
	
	return c;
	
}

// FACTORIAL

ll fact(ll n) {
	
	ll c=1;
	
	while(n>1) {
		c*=n;
		n--;
	}
	
	return c;	
	
}

// SIEVE of ERATOSTHENES

void sieve_of_eratosthenes (ll n, vl &a) {
	
	a[1]=0;
	
	for(ll i=2; i*i<=n ; i++) {
		if(a[i]==1) {
			for(ll j=i+i; j<=n ; j+=i) {		
				a[j]=0;
			}
		}
	}
	
}

//-------------------------------------------------------------*/--------------------------------------------------------------------------------
//---------------------------------------------------------------------------------------------------------------------------------------------

#include <iostream>
using namespace std;
int main(void){
    // Your code here!
    int a, b, c;
    cin >> a >> b >> c;
    if (c == 0) {
        if (a > b) {
            cout << "Takahashi" << endl;
        } else {
            cout << "Aoki" << endl;   
        }
    } else {
        if (a < b) {
            cout << "Aoki" << endl;
        } else {
            cout << "Takahashi" << endl;
        }
    }
}
