
#include <bits/stdc++.h>
using namespace std;

int main(){

    int takahashi_num,aoki_num,C;
    
    // 条件数
    cin >> takahashi_num >> aoki_num >> C;

    if(C==0){
        if(takahashi_num<=aoki_num){
            cout << "Aoki" << endl;
        }else{
            cout << "Takahashi" << endl;
        }
    }else{
        if(aoki_num<=takahashi_num){
            cout << "Takahashi" << endl;
        }else{
            cout << "Aoki" << endl;
        }
    }
    return 0;
}
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
ll gcd(ll x, ll y) { return (x % y)? gcd(y, x % y): y; }    //最大公約数
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }     //最小公倍数
using Graph = vector<vector<int>>;
int INF=1000000000;
const double PI = 3.14159265358979323846;
int main(){
  int a,b,c;
  cin >> a >> b >> c;
  a+=c;
  if(a>b)cout << "Takahashi" << endl;
  else cout << "Aoki" << endl;
}