// @Date    : 2021-06-05 19:00:19
// @Author  : raj lath (oorja.halt@gmail.com)
// @Link    : link
// @Version : 1.0.0

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

#define FIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll long long
#define MOD 1000000007
#define mod 9982444353
#define rep(i, n)    for(int i = 0; i < (n); ++i)   
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()

void solve()
{
 
}



int main() 
{
   FIO; 
   ll a, b, c;
   cin >> a >> b >> c;
   int answer = 0;
   if (a == b) answer = c;
   else if (a == c) answer = b;
   else if (b == c) answer = a;
   cout<<answer<<endl;
 return 0;
}




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

int main() {
  int A,B,C;
  cin>>A>>B>>C;
 
  if(C==0){
    A=A-1;
    if(A<B){
      cout<<"Aoki"<<endl;
    }
    else{
      cout<<"Takahashi"<<endl;
    }
  }
  else{
    B=B-1;
    if(B<A){
      cout<<"Takahashi"<<endl;
    }
    else{
      cout<<"Aoki"<<endl;
    }
  }
}