#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define range(x) (x).begin(), (x).end()
vector<long double> p;
vector<int> c;
vector<long double> ck, rck;
vector<ll> sum, rsum;
int n;
const long double EPS = 1e-12L;
long double f(long double x, long double y)
{
    ll sx = 0, sy = 0;
    int pos = upper_bound(range(ck), x) - ck.begin();
    if (pos - 1 >= int(sum.size()))
        sx = sum.back();
    else if (pos)
        sx = sum[pos - 1];
    // cout << pos << '\n';
    // cout << rck.size() << '\n';
    pos = upper_bound(range(rck) - pos, y) - rck.begin();
    if (pos - 1 >= int(rsum.size()))
        sy = rsum.back();
    else if (pos)
        sy = rsum[pos - 1];
    // cout << pos << '\n';
    // cout << sx << ' ' << sy << ' ' << x << ' ' << y << ' ' << sx + sy - max(sx * x, sy * y) << '\n';
    // if (sx + sy - max(sx * x, sy * y) > 15)
    //     cout << x << ' ' << y << ' ' << sx << ' ' << sy << '\n';
    return sx + sy - max(sx * x, sy * y);
}
long double get(long double x)
{
    long double l = 0, r = 1000010;
    long double lans = f(x, l), rans = f(x, r);
    long double ans = max(lans, rans);
    for (int _ = 0; _ < 3000; ++_) {
        long double lmid = l + (r - l) / 3;
        long double rmid = r - (r - l) / 3;

        lans = f(x, lmid), rans = f(x, rmid);
        ans = max(lans, rans);
        if (lans - rans >= EPS)
            r = rmid;
        else
            l = lmid;
    }
    // cout << x << ' ' << l << ' ' << ans << '\n';
    return ans;
}
void solve()
{
    cin >> n;
    p.resize(n + 5);
    c.resize(n + 5);
    for (int i = 1; i <= n; ++i)
        cin >> p[i] >> c[i];
    vector<pair<long double, int>> ckk;
    for (int i = 1; i <= n; ++i)
        ckk.emplace_back(p[i], c[i]);
    sort(range(ckk));
    for (const auto &[a, b] : ckk) {
        rck.push_back(1.L / (1 - a));
        rsum.push_back(b);
        if (rsum.size() > 1)
            rsum.back() += rsum.end()[-2];
    }

    reverse(range(ckk));
    for (const auto &[a, b] : ckk) {
        ck.push_back(1.L / a);
        sum.push_back(b);
        if (sum.size() > 1)
            sum.back() += sum.end()[-2];
    }
    // for (const auto &c : ck)
    //     cout << c << ' ';
    // cout << '\n';
    long double l = 0, r = 1000010;
    long double lans = get(l), rans = get(r);
    long double ans = max(lans, rans);
    for (int _ = 0; _ < 1000; ++_) {
        long double lmid = l + (r - l) / 3;
        long double rmid = r - (r - l) / 3;

        lans = get(lmid), rans = get(rmid);
        ans = max(lans, rans);
        if (lans - rans >= EPS)
            r = rmid;
        else
            l = lmid;
    }
    // cout << l << '\n';
    // cout << f(1 / .6L, 1.9) << '\n';
    // cout << get(1 / .6L) << '\n';
    cout << fixed << setprecision(10) << ans << '\n';
    // cout << f(0, 0) << '\n';
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    while (T--)
        solve();
    return 0;
}