#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;

int main(){

    int N;
    long long S=0;
    long double ans=0, a, s;
    cin >> N;
    assert(N <= 100000);
    vector<long long> A(N);

    for (int i=0; i<N; i++){
        cin >> A[i];
        S += A[i];
        assert(1 <= A[i]);
    }

    assert(S <= 1e18);

    sort(A.begin(), A.end());
    s = S;
    for (int i=0; i<N; i++){
        a = A[i];
        ans += a / s * a;
    }

    cout << setprecision(18) << s - ans + 1 << endl;

    return 0;
}