#include using namespace std; typedef unsigned long long ull; typedef long long ll; typedef pair pii; typedef pair pll; typedef pair pdd; typedef vector vll; typedef vector> vvll; //typedef vector> 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 bool chmax(T &a, const T &b) { if (a bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; } template ostream& operator << (ostream& os, const pair v){ os << "(" << v.first << ", " << v.second << ")"; return os; } template ostream& operator << (ostream& os, const vector v){ for(int i = 0; i < (int)v.size(); i++){if(i > 0){os << " ";} os << v[i];} return os; } template ostream& operator << (ostream& os, const vector> v){ for(int i = 0; i < (int)v.size(); i++){if(i > 0){os << endl;} os << v[i];} return os; } template void debug(vector>&v,ll h,ll w){for(ll i=0;i void debug(vector&v,ll n){if(n!=0)cerr<>i & 1)); } reverse(bit.begin(), bit.end()); return bit; } ll N; vector A(15, 0); pdd dp[600][1050]; pdd rec(ll D, ll mask){ if(dp[D][mask].first >= 0.0) return dp[D][mask]; if(mask==0){ if(D>300) return {1.0, 1.0}; else return {0.0, 0.0}; } double X = 0.0; double Y = 0.0; double maX = 0.0; REP(i, N){ if(mask>>i & 1){ auto PP = rec(D+A[i], mask^(1ll<>j & 1){ auto QQ = rec(D-A[j], mask^(1ll<> N; REP(i, N) cin >> A[i]; REP(i, 600)REP(j, 1050) dp[i][j] = {-1, -1}; auto res = rec(300, (1ll<