#include <bits/stdc++.h>

using namespace std;
using ll = long long;

typedef long double LD;

LD dp[1 << 22];
int a[22];
void solve() {
    int n; cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    for (int msk = 1; msk < (1 << n); msk++) {
        vector<pair<LD, LD>> win;
        for (int j = 0; j < n; j++) {
            if (msk & (1 << j)) {
                win.push_back({dp[msk ^ (1 << j)], a[j]});
            }
        }

        sort(win.begin(), win.end(), [](auto a, auto b){
            return a.first < b.first;
        });

        LD cur_ans = 0, R = 1, U = 1e9 + 11, L = 0;

        for (int j = 0; j < win.size(); j++) {
            if (win[j].first >= win[j].second - 1e-12) {
                continue;
            }
            if (win[j].second < cur_ans) break;
            LD diff = U - min(U, win[j].second);
            U = min(U, win[j].second);
            R -= diff * L;
            R -= (win[j].second - U) / (win[j].second - win[j].first);
            if (R < 0) break;
            L += 1.0L / (win[j].second - win[j].first);
            cur_ans = max(cur_ans, U - R / L);
        }
        for (int j = 0; j < win.size(); j++) {
            dp[msk] = max(dp[msk], win[j].first);
        }
        dp[msk] = cur_ans;
    }
    cout << fixed << setprecision(10);
    cout << dp[(1 << n) - 1] << endl;
}

signed main() {
#ifndef LOCAL
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
#endif
    int T = 1;
    // cin >> T;
    while (T--) solve();
}