#include <bits/stdc++.h>
#define int long long
using namespace std;
using ll = long long;
#define INF 0x3f3f3f3f
const int N = 1e5 + 10, M = 1e7 + 10;
const double eps = 1e-10;

int n, m;
vector<pair<double, ll>> b, a;
double sx[N], sy[N];

void solve()
{
    cin >> n;
    int len = 0;
    for (int i = 1; i <= n; i++)
    {
        pair<double, ll> x;
        cin >> x.first >> x.second;
        b.push_back(x);
    }
    sort(b.begin(), b.end(), greater());
    for (int i = 0; i < n; i++)
    {
        if (i == 0 || fabs(a[len - 1].first - b[i].first) > eps)
        {
            a.push_back(b[i]);
            len++;
        }
    }
    for (int i = 0; i < len; i++)
    {
        if (i == 0)
            sx[i] = a[i].second;
        else
            sx[i] = sx[i - 1] + a[i].second;
    }
    for (int i = len - 1; i >= 0; i--)
    {
        sy[i] = sy[i + 1] + a[i].second;
    }
    int l = 0, r = len - 1;
    double ans = 0;
    while (l < r)
    {
        double x = 1 / a[l].first;
        //cout<<x<<endl;
        while (x * a[l].first - 1 < 0)
        {
            x += eps;
            //cout<<x<<endl;
        }
        for (int j = r; j > l; j--)
        {
            //cout<<j<<endl;
            double y = 1 / (1 - a[j].first);
            while (y * (1-a[j].first) - 1 < 0)
            {
                y += eps;
            }
            if (sx[l] + sy[j] - max(sx[l] * x, sy[j] * y) > ans)
            {
                ans = sx[l] + sy[j] - max(sx[l] * x, sy[j] * y);
                r=j;
            }
            else
                break;
        }
        l++;
        //cout<<l<<' '<<r<<endl;
    }
    printf("%.10lf", ans);
}
signed main()
{
    int _t;
    _t = 1;
    // cin >> _t;
    while (_t--)
    {
        solve();
    }

    return 0;
}