#include <bits/stdc++.h>
using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
//typedef vector<vector<ll>> Graph;

const ll mod = 1e9 + 7;
//const ll mod = 998244353;

#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define spa << " " <<
#define fi first
#define se second

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }

template<class S, class T> ostream& operator << (ostream& os, const pair<S, T> v){
os << "(" << v.first << ", " << v.second << ")"; return os;
}
template<class T> ostream& operator << (ostream& os, const vector<T> v){
for(int i = 0; i < (int)v.size(); i++){if(i > 0){os << " ";} os << v[i];} return os;
}
template<class T> ostream& operator << (ostream& os, const vector<vector<T>> v){
for(int i = 0; i < (int)v.size(); i++){if(i > 0){os << endl;} os << v[i];} return os;
}

template<typename T> void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cerr<<v[i][0];for(ll j=1;j<w;j++)cerr spa v[i][j];cerr<<endl;}};
template<typename T> void debug(vector<T>&v,ll n){if(n!=0)cerr<<v[0];
for(ll i=1;i<n;i++)cerr spa v[i];
cerr<<endl;};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    ll P, Q, R;
    cin >> P >> Q >> R;

    random_device rnd;
    mt19937 mt(rnd());
    discrete_distribution<ll> disc({(double)P, (double)Q, (double)R});
    uniform_int_distribution<> uf(0, 1); 

    time_t start = clock();
    ll T = 0;
    vector<ll> cnt(6, 0);
    while((clock()-start) < 1.9*CLOCKS_PER_SEC){
        T++;
        ll r = disc(mt);

        for(ll x=0;x<3;x++){
            ll op;
            if(r==x){
                ll d = uf(mt);
                op = (x+d+1)%3;
            }else{
                op = 3 - r - x;
            }

            ll nokori = 3-op-x;
            if(r==x){
                cnt[x]++;
            }
            if(r==nokori){
                cnt[x+3]++;
            }
        }
    }

    double res = 0;
    for(ll i=0;i<6;i++){
        double val = (double)cnt[i]/T;
        chmax(res, val);
    }
    printf("%.12f\n", res);

    return 0;
}