#include <bits/stdc++.h>
#define rep(i, n)	for(int i=0;i<(int)(n);i++)
#define ALL(a)	(a).begin(),(a).end()
using namespace std;
using ll=long long;
typedef pair<int,int> P;

int main(){
    int a,b,c;
    cin>>a>>b>>c;
    cout<<(a*a+b*b<c*c ? "Yes" : "No")<<endl;
}
#include <bits/stdc++.h>
// #include <atcoder/modint>
// #include <atcoder/dsu>
// #include <atcoder/segtree>
// #include <atcoder/fenwicktree>
// #include <atcoder/math>
// using namespace atcoder;

using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<long long>;
using vvl = vector<vector<long long>>;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)

// using mint = modint1000000007;
// using mint = modint998244353;
// using mint = modint;

int main() {
  ll a,b,c; cin>>a>>b>>c;
  if(c==0) {
    if(a<=b) cout<<"Aoki\n";
    else cout<<"Takahashi\n";
  }
  if(c==1) {
    if(b<=a) cout<<"Takahashi\n";
    else cout<<"Aoki\n";
  }
}
