Problem: A MIPT student named Misha has a birthday today, and he decided to celebrate it in his country house in suburban Moscow. n friends came by, and after a typical party they decided to play blind man's buff.

The birthday boy gets blindfolded and the other players scatter around the house. The game is played in several rounds. In each round, Misha catches exactly one of his friends and has to guess who it is. The probability of catching the i-th friend does not change between rounds and is equal to pi percent (as we know, it is directly proportional to the amount of alcohol consumed by the i-th friend) and p1 + p2 + ... + pn = 100 holds. Misha has no information about who he caught. After Misha makes an attempt to guess the caught person, the round ends. Even then, Misha isn't told whether he guessed correctly, and a new round begins.

The game ends when Misha guesses every friend at least once, that is, there exists such set of rounds k1, k2, ..., kn, that during round number ki Misha caught the i-th friend and guessed him. Misha wants to minimize the expectation of the number of rounds of the game. Despite the fact that at any point in the game Misha has no information about who he has already guessed, his friends are honest, and if they see that the condition for the end of the game is fulfilled, the game ends immediately. Find the expectation of the number of rounds in the game if Misha plays optimally.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 100) — the number of Misha's friends.

The second line contains n integers pi (<image>), giving the probability to catch the i-th friend in one particular round in percent.

Output

Print a single real value — the expectation of the number of rounds provided that Misha plays optimally. Your answer will be considered correct if its absolute or relative error does not exceed 10 - 6. 

Namely: let's assume that your answer is a, and the answer of the jury is b. The checker program will consider your answer correct, if <image>.

Examples

Input

2
50 50


Output

5.0000000000


Input

4
50 20 20 10


Output

39.2846263444

Note

The optimal strategy in the first sample is to guess friends alternately.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 1e2 + 5;
int n, m, x, y;
const double eps = 1e-12;
double A[N];
struct NODE {
  int x;
  double bef, now;
  friend bool operator<(NODE a, NODE b) {
    return a.bef * b.now > a.now * b.bef;
  }
};
priority_queue<NODE> q;
int main() {
  cin >> n;
  double who = 1;
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &x);
    A[i] = 1 - (double)x / 100;
    q.push((NODE){i, 1 - A[i], 1 - A[i] * A[i]});
    who = who * (1 - A[i]);
  }
  int cnt = n;
  double ans = 0;
  ans += cnt * who;
  for (int i = cnt + 1; i <= 5e5; ++i) {
    NODE now = q.top();
    q.pop();
    ans = ans + (who / now.bef * now.now - who) * i;
    who = who / now.bef * now.now;
    q.push((NODE){now.x, now.now, 1 - (1 - now.now) * A[now.x]});
  }
  printf("%.12lf\n", ans);
}