#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


using Double = double;

int N;
vector<Int> W;

int main() {
  for (; ~scanf("%d", &N); ) {
    W.resize(N + 1);
    for (int i = 1; i <= N; ++i) {
      scanf("%lld", &W[i]);
    }
    
    vector<int> lpf(N + 1), primes;
    for (int p = 2; p <= N; ++p) lpf[p] = p;
    for (int p = 2; p <= N; ++p) if (lpf[p] == p) {
      primes.push_back(p);
      for (int n = p; n <= N; n += p) chmin(lpf[n], p);
    }
    
    Int sumW = 0;
    for (int i = 1; i <= N; ++i) {
      sumW += W[i];
    }
    auto ws = W;
    for (const int p : primes) {
      for (int i = 1; i * p <= N; ++i) ws[i * p] += ws[i];
    }
    
    // f + f^2 + f^3 + ... (lcm conv)
    vector<Double> fs(N + 1, 0.0);
    for (int i = 1; i <= N; ++i) fs[i] = ws[i] / (Double)(sumW - ws[i]);
    
    // precision?
    for (const int p : primes) {
      for (int i = N / p; i >= 1; --i) fs[i * p] -= fs[i];
    }
    Double ans = 0.0;
    for (int i = 1; i <= N; ++i) {
      ans += fs[i];
    }
    printf("%.12f\n", ans);
  }
  return 0;
}