#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
//#pragma GCC optimization("unroll-loops")

#include <bits/stdc++.h>
#define readFast ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define fin cin
#define ll long long
#define sz(x) (int)(x).size()
#define all(v) v.begin(), v.end()
#define output(x) ((int)x && cout << "YES\n") || cout << "NO\n";
#define ld long double
#define pii pair<int,int>
using namespace std;

#ifdef LOCAL
#define read() ifstream fin("date.in.txt")
#else
#define read() readFast
#endif // LOCAL

const int N = 2005;


int main() {
    read();

    int a[4];
    for (int i = 1; i <= 3; ++i)
        fin >> a[i];

    sort(a + 1, a + 4);
    if(a[3] - a[2] == a[2] - a[1])
        cout << "Yes\n";
    else
        cout << "No\n";

    return 0;
}  /*stuff you should look for
	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* WRITE STUFF DOWN
	* DON'T GET STUCK ON ONE APPROACH
~Benq~*/

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int a,b,c;cin>>a>>b>>c;
    if(c==0)
        a>b?cout<<"Takahashi"<<endl:cout<<"Aoki"<<endl;
    else
        b>a?cout<<"Aoki"<<endl:cout<<"Takahashi"<<endl;
}

/*                         *      *                  *           *
  *                       *       *                  *           *
   *                     *        *                  *           *
    *         *         *         *                  *           *
     *       * *       *          *                  *************
      *     *   *     *           *                  *           *
       *   *     *   *            *                  *           *
        * *       * *             *                  *           *
         *         *              **************     *           */
