#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using VI = vector<int>;
using PII = pair<int,int>;
using VVI = vector<vector<int>>;
const ll mod = 998244353;
const ll INF = 1e18;
const int N = 2e6 + 10;
const double eps = 1e-9;
void solve(){
	
}
ll s[N];
int n;
pair<double , double> a[N];

double calc(int x , int y){
	double res = 0;
	double px = (double)1 / a[x].first;
	double py = (double)1 / (1.0 - a[y].first);
	double sx = s[x];
	double sy = s[n] - s[y - 1];
	//cout<<px<<py<<sx<<sy<<" ";
	return sx + sy - max(sx * px , sy * py);
	
}
int main() {
	ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
   //int T;cin>>T;while(T--)solve();
    cin>>n;
    for(int i = 1 ; i <= n ; i++){
    	cin>>a[i].first>>a[i].second;
    	if(a[i].first == 0) a[i].first += eps;
    	else if(a[i].first == 1) a[i].first -= eps;
    }
    sort(a + 1 , a + 1 + n , greater());
    for(int i = 1 ; i <= n ; i++) s[i] = s[i - 1] + a[i].second;
	//cout<<calc(1 , 3);
    double res = 0;
    for(int i = 1 ; i <= n ; i++){
    	int l = i + 1;
    	int r = n;
    	//cout<<i<<":\n";
    	//cout<<l<<" "<<r<<" \n";
    	while(l < r){
    		int lmid = l + (r - l) / 3;
    		int rmid = r - (r - l) / 3;
    		res = max({res , calc(i , lmid) , calc(i , rmid)});    
    		//cout<<lmid<<" "<<rmid<<"\n";
    		if(calc(i , lmid) >= calc(i , rmid)) l = lmid + 1;
    		else r = rmid - 1;
    	}
    	//cout<<l<<" "<<r<<" \n";
    	//cout<<calc(i , l);
    	//cout<<calc(i , r);
    	//cout<<endl;
    	res = max({res , calc(i , l) , calc(i , r)});    		
    }
    
    //10 / 3
    //2.5
    //2
    
    
    printf("%.7f" , res); 
    
    
}


//5 4 3 2 1
//5 4 3 2 1