#include <iostream>

using namespace std;

int main()
{
  int T, A, C;
  cin>>T>>A>>C;
  
  if((T >= 0 && A <= 100) && (C == 0 || C == 1))
  {
  	C == 0 ? (T > A ? cout<<"Takahashi" : cout<<"Aoki") : (A > T ? cout<<"Aoki" : cout<<"Takahashi") ;
  }
  return 0;
}

/* Hardwork allways pays off */
//You never know how close to the solution you are ,so keep practicing
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp> // Common file 
#include <ext/pb_ds/tree_policy.hpp> 
#include <functional> // for less 
#include <iostream> 
using namespace __gnu_pbds; 
using namespace std; 
  
#define int long long  

#define ld long double
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define pii pair<int,int>
#define endl '\n'
#define REP(i,n) for(int i=1;i<=n;i++)
#define tol(s) transform(s.begin(),s.end(),s.begin(),::tolower)
#define tou(s) transform(s.begin(),s.end(),s.begin(),::toupper)
#define ios ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define all(x) (x).begin(), (x).end()
#define mod1 998244353 
#define mod 1000000007 
#define pie 3.141592653589793238
#define printv(x) for(i=0;i<x.size();i++) cout<<x[i]<<" ";
#define printA(x,n) for(i=0;i<n;i++) cout<<x[i]<<" ";
#define F first
#define S second
#define vi vector<int>
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> new_data_set; 

void make_unique(vector<int> vec)
{
sort(all(vec));
vec.resize(unique(all(vec)) - vec.begin());
}
 
bool isPowerOfTwo(int n)
{
   if(n==0)
   return false;
 
   return (ceil(log2(n)) == floor(log2(n)));
}
int cceil(int x, int y){
    return (x+y-1)/y;
}
struct Cmp
{
        bool operater(const pair<int,int> &a,const pair<int,int> &b)
       {
               return (a.second)<(b.second);
       }

};
bool cmp(const pair<int,int> &a,const pair<int,int> &b)
{
       return (a.second)<(b.second);
}
signed main() 
 {   ios;
    #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin); 
    freopen("output.txt", "w", stdout);
    #endif
    // cout.precision(1);
    // cout<<fixed;
    int t=1;
    // init();
      // cin>>t; 
    while(t--)
    {
        int n,x,i,j,flag=0,count=0;
        int a,b,c;
        cin>>a>>b>>c;
        if(a==0&&b==0&&c==1)
          cout<<"Takahashi"<<endl;
        else if(c==0)
        {
          // a--;

          while(a!=0&&b!=0)
          {
            if(i%2==0)
            {a--;
             i++;
            }
            else 
            {b--;
              i++;
            }
          }
          if(a>0)
            cout<<"Takahashi"<<endl;
          else 
            cout<<"Aoki"<<endl;

        }  
        else 
        {
            // b--;

          while(a!=0&&b!=0)
          {
            if(i%2==0)
            {b--;
             i++;
            }
            else 
            {a--;
              i++;
            }
          }
          if(a>0)
            cout<<"Takahashi"<<endl;
          else 
            cout<<"Aoki"<<endl;

        }
    }
    return 0;
 
}