#include <algorithm>
#include <cmath>
#include <vector>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <ctype.h>
#include <climits>
#include <stack>
#include <queue>
#include <cassert>
#include <iomanip>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < (ll)(n); ++i)
#define FOR(i, a, b) for(ll i=(a); i < (ll)(b); ++i)
template<class T> inline bool chmax(T& a, T b) { if(a < b){ a=b; return 1; } return 0;}
template<class T> inline bool chmin(T& a, T b) { if(a > b){ a=b; return 1; } return 0;}

int main(){
	int a,b,c;
	cin >> a >> b >> c;
	
	if(a+c > b ) cout << "Takahashi\n";
	else cout << "Aoki\n";
	
	return 0;
}
#include "bits/stdc++.h"
using namespace std;
#define int long long int
int32_t main()
{
   int a,b,c;
   cin>>a>>b>>c;
   if(c==1)
    swap(a,b);
   
    if(a>b)
    {
        if(c==1)
        {
            cout<<"Aoki"<<endl;
        }
        else
        {
            cout<<"Takahashi"<<endl;
        }
    }
    else
    {
        if(c==0)
        {
            cout<<"Aoki"<<endl;
        }
        else
        {
            cout<<"Takahashi"<<endl;
        }
    }

    return 0;
}