#include <bits/stdc++.h>

using namespace std;

#define dbg(x) cerr << #x << "=" << x << "\n"
#define MULTI int _; cin >> _; while (_--)

#define int long long
#define ull unsigned long long
typedef long long ll;

const int N = 1e6 + 5, INF = 0x3f3f3f3f3f3f3f3f;

struct Node {
	double p;
	int c;
	
	bool operator<(const Node &x) const {
		return p > x.p;
	}
};

void solve() {
	int n;
	cin >> n;
	
	vector<Node> a(n);
	for (int i = 0; i < n; i++) {
		cin >> a[i].p >> a[i].c;
	} 
	
	sort(a.begin(), a.end());
	
	vector<double> sy(n + 1);
	double sx = 0;
	for (int i = n - 1; i >= 0; i--) {
		sy[i] = sy[i + 1] + a[i].c;
	}
	
	int fg1 = -1, fg0 = n;
	for (int i = 0; i < n; i++) {
		if (a[i].p == 1) {
			fg1 = max(fg1, i);
		} else if (a[i].p == 0) {
			fg0 = min(fg0, i);
		}
	}
	
	double res = 0;
	for (int i = 0; i < min(n, fg0); i++) {
		double x = 1.0 / a[i].p;
		sx += a[i].c;
		
		if (i != min(n, fg0) - 1 && a[i].p == a[i + 1].p) continue;
		
		int l = max(i + 1, fg1 + 1), r = n - 1, lm, rm;
		double ans = -INF;
		
		function<double(int)> check = [&](int mid) -> double {
			return sx + sy[mid] - max(sx * x, sy[mid] * 1.0 / (1.0 - a[mid].p));
		};
		
		if (l == r) {
			res = max(res, check(l));
		}
		
		while (l < r) {
			lm = l + (r - l) / 3;
			rm = r - (r - l) / 3;
			
			double ck1 = check(lm), ck2 = check(rm);
			if (ck1 < ck2) {
				ans = max(ans, ck2);
				r = rm - 1;
			} else {
				ans = max(ans, ck1);
				l = lm + 1;
			}
		}
		
		res = max(res, ans);
	}
	
	cout << fixed << setprecision(10);
	cout << res << "\n";
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	solve();
	return 0;
}