#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <queue>
#include <map>
#include <cstdio>
#include <cstring>
#include <set>
#include <math.h>

typedef long long ll;
using  namespace  std;






int main() {


    int a,b,c;
    cin>>a>>b>>c;
    if (c==0){
        if(a>=b+1) cout<<"Takahashi"<<endl;
        else cout<<"Aoki"<<endl;
    }else{
        if(b>=a+1)cout<<"Aoki"<<endl;
        else cout<<"Takahashi"<<endl;
    }

    return 0;
}

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
long long a[3];
void solve()
{
    sort(a,a+3);
    if (2*a[1]==a[2]+a[0]) puts("Yes");
    else puts("No");
}
int main()
{
    while(cin>>a[0]>>a[1]>>a[2])
        solve();
}