#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using ll = long long;
#define REP(i, n) for (ll i = 0; i < ll(n); i++)
#define FOR(i, a, b) for (ll i = a; i <= ll(b); i++)
#define ALL(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < n; i++)

#define INF (int)1e9
#define LLINF (long long)1e12
#define MOD (int)1e9 + 7
#define PI 3.141592653589
#define PB push_back
#define F first
#define S second
#define co cout <<
#define en << endl;
#define __MAGIC__              \
  ios::sync_with_stdio(false); \
  cin.tie(nullptr);

#define YESNO(T)           \
  if (T)                   \
  {                        \
    cout << "YES" << endl; \
  }                        \
  else                     \
  {                        \
    cout << "NO" << endl;  \
  }
#define yesno(T)           \
  if (T)                   \
  {                        \
    cout << "yes" << endl; \
  }                        \
  else                     \
  {                        \
    cout << "no" << endl;  \
  }
#define YesNo(T)           \
  if (T)                   \
  {                        \
    cout << "Yes" << endl; \
  }                        \
  else                     \
  {                        \
    cout << "No" << endl;  \
  }

#define Graph vector<vector<int>>
#define PII pair<int, int>
#define VI vector<int>
#define VVI vector<vector<int>>
#define VPII vector<pair<int, int>>
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
#define DDD fixed << setprecision(10)

using namespace std;
/*..................DEFINE GLOBAL VARIABLES...................*/

/*.....................DEFINE FUNCTIONS ......................*/
ll dist(ll x, ll y)
{
  return (x * x) + (y * y);
};
/*.........................kemkemG0...........................*/
signed main()
{
  __MAGIC__
  int a, b, c;
  cin >> a >> b >> c;

  if (c == 0)
  {
    if (a <= b)
    {
      co "Aoki" en
    }
    else
    {
      co "Takahashi" en
    };
  }
  else
  {
    if (b <= a)
    {
      co "Takahashi" en
    }
    else
    {
      co "Aoki" en
    };
  };
  return 0;
}

#include <algorithm>
#include <cmath>
#include <vector>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <ctype.h>
#include <climits>
#include <stack>
#include <queue>
#include <cassert>
#include <iomanip>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < (ll)(n); ++i)
#define FOR(i, a, b) for(ll i=(a); i < (ll)(b); ++i)
template<class T> inline bool chmax(T& a, T b) { if(a < b){ a=b; return 1; } return 0;}
template<class T> inline bool chmin(T& a, T b) { if(a > b){ a=b; return 1; } return 0;}

int main(){
	int a[3];
	cin >> a[0] >> a[1] >> a[2];
	sort(a,a+3);
	
	double dp[101][101][101] = {};
	dp[a[0]][a[1]][a[2]] = 1;
	FOR(A,a[0],100){
		FOR(B,a[1],100){
			FOR(C,a[2],100){
				if(A+B+C == 0) continue;
				dp[A+1][B][C] += dp[A][B][C] * (A/(double)(A+B+C)) ;
				dp[A][B+1][C] += dp[A][B][C] * (B/(double)(A+B+C));
				dp[A][B][C+1] += dp[A][B][C] * (C/(double)(A+B+C)) ;
			}
		}
	}
	
	double ans = 0.0;
	
	FOR(A,a[0],101){
		FOR(B,a[1],101){
			FOR(C,a[2],101){
				if(A==100 || B==100 || C==100){
					ans += dp[A][B][C]  * (A+B+C-(a[0]+a[1]+a[2]));
				}
			}
		}
	}
	
	printf("%.10f\n",ans);
	
	return 0;
}