#include<bits/stdc++.h>
using namespace std;
#define intt long long int
#define intu unsigned long long int
#define vi vector<intt>
#define ii pair<int,int>
#define pb push_back
//#define mp make_pair
#define ff first
#define ss second
#define fast_io ios::sync_with_stdio(0);cin.tie(NULL);std::cout.tie(NULL);
# define PI           3.14159265358979323846 
#define all(a) a.begin(),a.end()
#define for0(i, n) for (int i = 0; i < n; i++)
#define for1(i, n) for (int i = 1; i <= n; i++)
#define loop(i,a,b) for (int i = a; i < b; i++)
#define bloop(i,a,b) for (int i = a ; i>=b;i--)
#define tc(t) int t; cin >> t; while (t--)
int mod = 1000000007;
int gcd(int a, int b) {return b ? gcd(b, a % b) : a;}
int lcm(int a, int b) {return a * b / gcd(a, b); }
intt bpow(intt a,intt b) 
{
  intt res = 1;
  while (b > 0) {
    if (b & 1)res = ((res%mod) * (a%mod))%mod;
      a = ((a%mod) * (a%mod))%mod;
      b >>= 1;
  }
  return res;
}
intt fact(intt n) { 
   if ((n==0)||(n==1))
      return 1; 
   else
      return n*fact(n-1);
}
void go()
{
#ifndef ONLINE_JUDGE
  freopen("in.txt","r",stdin);
  freopen("OUt.txt","w",stdout);
  #endif
}

int main() 
{ 
    fast_io
    go();
    int a,b,c;cin>>a>>b>>c;
    if(c==0 && a==0){
      cout <<"Aoki" << "\n";
      return 0;
    }
    if(c==1 && b==0){
      cout << "Takahashi" << "\n";
       return 0;
    }
    while(1){
      if(c==0 && a>0){
        a--;
      }
      else if(c==0 && a==0){
        cout <<"Aoki" << "\n";
        break;
      }
      if(c==1 && b>0){
        b--;  
      }
      else if(c==1 && b==0){
        cout << "Takahashi" << "\n";
        break;
      }
      c^=1;
    }
}




















/*!
    You are under no obligation to be the same person you were a minute ago,
    You have the right to grow !
*/
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <numeric>
#include <utility>
#include <climits>
#include <iomanip>
#include <unordered_map>
#include <unordered_set>
#include <time.h>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
using namespace std;
#define ll long long 
#define pb push_back
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
//typedef long long  MOD=1000000009;
ll MOD=998244353;
ll add(ll x, ll y) {ll res = x + y; return (res >= MOD ? res - MOD : res);}
ll mul(ll x, ll y) {ll res = x * y; return (res >= MOD ? res % MOD : res);}
ll sub(ll x, ll y) {ll res = x - y; return (res < 0 ? res + MOD : res);}
ll lcm(ll x, ll y) {ll res = (x * y) / __gcd(x, y); return res;}
ll power(ll x, ll y) {if (y < 0) return 1; ll res = 1; x %= MOD; while (y) {if (y & 1)res = mul(res, x); y >>= 1; x = mul(x, x);} return res;}

void iofoj(){
	#ifndef ONLINE_JUDGE
	freopen("input.txt","r",stdin);
	freopen("output.txt","w",stdout);
	freopen("error.txt","w",stderr);
	#endif
}
#define F first
#define S second

void solution()
{
    ll k,i,j,n,m,w;
    cin>>n>>m>>k;
    if(k==0)
    {
        if(n>m)
        {
            cout<<"Takahashi";
        }
        else cout<<"Aoki";
    }
    else
    {
        if(m>n)cout<<"Aoki";
        else cout<<"Takahashi";
    }
    //else cout<<"";
}

int main(){
    fio
    //iofoj();
    // ll t;
    // cin>>t;
    // for(ll i=1;i<=t;i++)
    solution();
    return 0; 
}
