//PochurSolveKortaHobaa
#include<bits/stdc++.h>
using namespace std;
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int a,b,c;
    cin>>a>>b>>c;

    if(c==0){
        while(1){
            a--;
            if(a<=0){
                    cout<<"Aoki";
                    break;
            }
            b--;
            if(b<=0){
                    cout<<"Takahashi";
                    break;
            }
        }
    }
    else{
            while(1){
                 b--;
                 if(b<=0){
                        cout<<"Takahashi";
                         break;
                 }
                a--;
                if(a <=0){
                        cout<<"Aoki";
                        break;
                }
            }
    }
    /*if(c==0){
        if(a>b)cout<<"Takahashi";
        else cout<<"Aoki";
    }
    else{
        if(a>b)cout<<"Aoki";
        else cout<<"Takahashi";
    }*/
}
/*
          -NEVER GIVE UP.
          -Recite QURAN.
          -The harder it looks the easier it'll be.
          -Remember how you started.
          -Why you doing this?                          */

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1000000000
#define endl "\n"
#define all(s) s.begin(),s.end()
#define pb push_back
#define pi 3.1415926536
#define dig(a) fixed<<setprecision(a)
#define fast() ios_base::sync_with_stdio(false); cin.tie(NULL);
const int M = 1e9+7;
const int maxx = 1e7+5;
ll power(ll a, ll n) { 
ll res = 1; 
while (n) { 
if (n % 2) {res = (res * a) % M;} 
n >>= 1; a = (a * a) % M;} 
return res;
}
const int m = 105;
double dp[m][m][m];
double solve(int a, int b, int c){
	if(a>=100 || b>=100 || c>=100) return 0;
	if(dp[a][b][c]) return dp[a][b][c];
	double res = 0;
	res+=solve(a+1,b,c)*a;
	res+=solve(a,b+1,c)*b;
	res+=solve(a,b,c+1)*c;
	res = res/(a+b+c)+1;
	dp[a][b][c] = res;
	return res;
}
int main(){
	fast();
	int a,b,c;
	cin>>a>>b>>c;
	cout<<dig(9)<<solve(a,b,c);
	return 0;
}
