#include<bits/stdc++.h> 
#define int long long
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define endl "\n"
using namespace std;

const int max_n = 1e5+100;
const int max_len = 631441 + 100000;
const int max_sum = 1e7+100;
const int offset = 1e5+10;
const int inf = 1e18;

signed main(){
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    int a,b,c;
    cin>>a>>b>>c;
    if(a>b){
    	cout<<"Takahashi"<<endl;
    }else if(b>a){
    	cout<<"Aoki"<<endl;
    }else{
    	if(c==1){
    		cout<<"Takahashi"<<endl;
    	}else{
    		cout<<"Aoki"<<endl;
    	}
    }

}
/*
Author: Hrujul Thumar
*/
#include <bits/stdc++.h>
#define int         long long
#define MOD         100000007
#define endl        '\n'
#define fastio       ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
#define pi          3.141592653589793238
#define op(a)        cout << (a ? "Takahashi" : "Aoki") << '\n';
const long long MAX_SIZE = 1000000000;
using namespace std;

int visited[1000000];
int a[10000000];
vector<int> v[1000000];
int diff=-1000000000;
int mx=0;
void dfs(int l)
{
        mx=max(mx,a[l]);
        visited[l]=1;
        for(auto &i:v[l])
        {
            dfs(i);
        }
}
signed main()
{
    fastio;
    int t=1;    
    //cin>>t;
    while(t--)
    {
        int a,b,c;
        cin>>a>>b>>c;
        while(a && b){
            if(c)
            {
                b--;
            }
            else a--;
            c++;
            c%=2;
        }
        if(a && !c)op(1)
        else if(b && c)op(0)
        else if(!a && !c)op(0)
        else if(!b && c)op(1)
        else if(a && c)op(1)
        else if(b && !c)op(0)

    }
}

