Problem: Manao's friends often send him new songs. He never listens to them right away. Instead, he compiles them into a playlist. When he feels that his mind is open to new music, he opens the playlist and starts to listen to the songs.

Of course, there are some songs that Manao doesn't particuarly enjoy. To get more pleasure from the received songs, he invented the following procedure of listening to the playlist:

  * If after listening to some song Manao realizes that he liked it, then he remembers it and starts to listen to the next unlistened song. 
  * If after listening to some song Manao realizes that he did not like it, he listens to all the songs he liked up to this point and then begins to listen to the next unlistened song. 



For example, if Manao has four songs in the playlist, A, B, C, D (in the corresponding order) and he is going to like songs A and C in the end, then the order of listening is the following:

  1. Manao listens to A, he likes it, he remembers it. 
  2. Manao listens to B, he does not like it, so he listens to A, again. 
  3. Manao listens to C, he likes the song and he remembers it, too. 
  4. Manao listens to D, but does not enjoy it and re-listens to songs A and C. 



That is, in the end Manao listens to song A three times, to song C twice and songs B and D once. Note that if Manao once liked a song, he will never dislike it on a subsequent listening.

Manao has received n songs: the i-th of them is li seconds long and Manao may like it with a probability of pi percents. The songs could get on Manao's playlist in any order, so Manao wants to know the maximum expected value of the number of seconds after which the listening process will be over, for all possible permutations of the songs in the playlist.

Input

The first line contains a single integer n (1 ≤ n ≤ 50000). The i-th of the following n lines contains two integers, separated by a single space — li and pi (15 ≤ li ≤ 1000, 0 ≤ pi ≤ 100) — the length of the i-th song in seconds and the probability that Manao will like the song, in percents.

Output

In a single line print a single real number — the maximum expected listening time over all permutations of songs. The answer will be considered valid if the absolute or relative error does not exceed 10 - 9.

Examples

Input

3
150 20
150 50
100 50


Output

537.500000000


Input

4
300 0
300 50
240 50
360 80


Output

2121.000000000

Note

Consider the first test case. If Manao listens to the songs in the order in which they were originally compiled, the mathematical expectation will be equal to 467.5 seconds. The maximum expected value is obtained by putting the first song at the end of the playlist.

Consider the second test case. The song which is 360 seconds long should be listened to first. The song 300 seconds long which Manao will dislike for sure should be put in the end.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, i;
  cin >> n;
  vector<pair<int, int> > v(n);
  for (i = 0; i < n; i++) {
    cin >> v[i].second >> v[i].first;
  }
  sort(v.begin(), v.end());
  reverse(v.begin(), v.end());
  int h = n - 1;
  int g = 0;
  while (v[h].first == 0) h--;
  while (v[g].first == 100) g++;
  vector<pair<double, int> > w;
  for (i = g; i <= h; i++) {
    pair<double, int> lol;
    double p = v[i].first / 100.0;
    lol.first = v[i].second * p / (1 - p);
    lol.second = i;
    w.push_back(lol);
  }
  sort(w.begin(), w.end());
  reverse(w.begin(), w.end());
  vector<pair<int, int> > v6(n);
  for (i = 0; i < n; i++) v6[i] = v[i];
  for (i = g; i <= h; i++) v6[i] = v[w[i - g].second];
  vector<long long> dislikes(n);
  dislikes[n - 1] = 0;
  for (i = n - 2; i >= 0; i--)
    dislikes[i] = dislikes[i + 1] + (100 - v6[i + 1].first);
  long double sum = 0;
  cout.precision(10);
  for (i = 0; i < n; i++) {
    sum += v6[i].second;
    sum += v6[i].first * v6[i].second * dislikes[i] / 10000.0;
  }
  cout << sum;
}