            /*

              (                                 _
               )                               /=>
              (  +____________________/\/\___ / /|
               .''._____________'._____      / /|/\
              : () :              :\ ----\|    \ )
               '..'______________.'0|----|      \
                                0_0/____/        \
                                    |----    /----\
                                   || -\\ --|      \
                                   ||   || ||\      \
                                    \\____// '|      \
            Bang! Bang!                     .'/       |
                                           .:/        |
                                           :/_________|

            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
             BALJOT SINGH
             EVERYONE HAS THEIR OWN TIME
             DEBUG->COMMENT FAST
            ~~~~~~~~~~~~~~~~~~~~~~
            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~*/
            #include <bits/stdc++.h>

            #include <ext/pb_ds/assoc_container.hpp>
            #include <ext/pb_ds/tree_policy.hpp>
            #define fi first
            #define se second
            #define loop(i,a,b)               for(int i = a; i<=b ; i++)
            #define rep(i,a,b)              for(int i = a; i>=b ; i--)
            #define pb push_back
            #define mp make_pair
            #define setbits(x)      __builtin_popcountll(x)
            #define zerobits(x)      __builtin_ctzll(x)
            #define FAST ios_base :: sync_with_stdio (false); cin.tie (NULL) ;cout.tie(NULL);

            using namespace std;
            using namespace __gnu_pbds;

           // #define int long long
            using ll =long long ;
            template<class T> using pbds =  tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;




            const ll M = 1e9 + 7;
            const ll iM = 1e5 + 5;
            const ll inf = 2e18;


            //modular arithmetic worst part-----------------------------------
            ll mod(ll x,const ll M=M){ return (x+M)%M;}
            ll mod_min(ll a, ll b,const ll M=M){ ll ans= (mod(a,M)-mod(b,M)); return mod(ans,M);}
            ll mod_mul(ll a,ll b,const ll M=M){  return mod(mod(a,M)*mod(b,M),M);}
            ll mod_add(ll a,ll b,const ll M=M){ return mod(mod(a,M)+mod(b,M),M);}
            ll power(ll x,ll y,const ll M=M)  {  ll res = 1;if (x == 0) return 0;while (y > 0){if (y & 1) res=mod_mul(res,x,M); y = y>>1; x=mod_mul(x,x,M);} return res;}
            ll gcd_extend(ll a, ll b, ll& x, ll& y) {if (b == 0) {x = 1;y = 0;return a;}ll x1, y1;ll d = gcd_extend(b, a % b, x1, y1);x = y1;y = x1 - y1 * (a / b);return d;}
            ll modinverse(ll value,const ll M=M) {ll x, y;ll res=gcd_extend(value,M,x,y);if(res!=1)return -1;return mod(x,M);}

signed main()
{   FAST;
	ll a,b,c;
	cin>>a>>b>>c;
	if(a==b)
    {
        if(!c)
        cout<<"Aoki";
        else
            cout<<"Takahashi";
    }
    else if(a>b)
        cout<<"Takahashi";
    else
     cout<<"Aoki";

	return 0;
}

#include <iostream>
using namespace std;


int main()
{
	int a,b,c;
	cin>>a>>b>>c;
	if(c==0)
	{
		if(a==0) 
		{
			cout<<"Aoki";
		}
		else
		{
			if(b==0) cout<<"Takahashi";
		}
		
	}
	else
	{
		if(b==0) 
		{
			cout<<"Takahashi";
		}
		else
		{
			if(a==0) cout<<"Aoki";
		}
	}
	if(c==0)
	{
		while(a > 0 && b > 0)
		{
			a--;
			if(a == 0)
			{
				cout<<"Aoki";
				break;
			}		
			b--;
			if(b==0)
			{
				cout<<"Takahashi";
				break;
			} 
		}
	}
	else
	{
		while(a > 0 && b > 0)
		{
			b--;
			if(b == 0)
			{
				cout<<"Takahashi";
				break;
			}	
			a--;
			if(a==0) 
			{
				cout<<"Aoki";
				break;
			}
		}
	}
	return 0;
}