#include <bits/stdc++.h>
using namespace std;
#define int long long
#define quickread                     \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL);                    \
    cout.tie(NULL);
#define pb push_back
#define all(x) x.begin(), x.end()
#define hii cout << "Hii there Sparky! \n"
#define endl '\n'
#define mod 1000000007
//#define mod 998244353
#define maxn 100010 //check the limits, dummy

void solve() {
    int a, b, c;
    cin >> a >> b >> c;
    if (c == 0) {
        if (a > b) {
            cout << "Takahashi" << endl;
        } else {
            cout << "Aoki" << endl;
        }
    } else {
        if (b > a) {
            cout << "Aoki" << endl;
        } else {
            cout << "Takahashi" << endl;
        }
    }
}

int32_t main() {
    quickread;
    int test = 1;
    //cin >> test;
    for (int i = 0; i < test; i++) {
        solve();
    }
    return 0;
}
#include <bits/stdc++.h>
using namespace std;
const int maxn=1e2+5;
double dp[maxn][maxn][maxn];
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int a,b,c;
    cin>>a>>b>>c;
    for (int i=99; i>=a; i--) {
        for (int j=99; j>=b; j--) {
            for (int k=99; k>=c; k--) {
                double m=i+j+k;
                dp[i][j][k] = i/m*(dp[i+1][j][k]+1) + j/m*(dp[i][j+1][k]+1) + k/m*(dp[i][j][k+1]+1);
            }        
        }
    }
   printf("%.9lf",dp[a][b][c]);
    return 0;
}