#include<bits/stdc++.h>
using namespace std;
const double eps=1e-12;
struct node
{
	double p,v;
	int id;
	node()
	{
		p=v=id=0;
	}
	node(double a,double b,int c)
	{
		p=a; v=b; id=c;
	}
	bool operator < (const node &t)
	{
		return p>t.p;
	}
};
void O_o()
{
	int n;
	cin>>n;
//	vector<int> t(n+1);
	vector<array<double,2>> a(n+1);
	int cnt=0;
	a[0][0]=2;
	for(int i=1; i<=n; i++)
	{
		double x,y;
		cin>>x>>y;
		if(x<=eps)
			x+=eps;
		else if(1-x<=eps)
			x-=eps;
		if(fabs(x-a[cnt][0])<=eps)
		{
			a[cnt][1]+=y;
		}
		else
		{
			a[++cnt]={x,y};
		}
	}
	a.resize(cnt+1);
	sort(a.begin()+1,a.end(),greater<>());
	n=a.size()-1;
	vector<node> b(n+1);
	for(int i=1; i<=n; i++)
	{
		b[i]=node(1.0-a[i][0],a[i][1],i);
	}
	sort(b.begin()+1,b.end());
	vector<int> pos(n+1);
	for(int i=1; i<=n; i++)
		pos[b[i].id]=i;
	vector<bool> del(n+1);
	int r=1;
	double x=0,y=0,sx=0,sy=0;
	vector<int> st;
	double ans=0;
	for(int i=1; i<=n; i++)
	{
		x=1.0/a[i][0];
		sx+=a[i][1];
		if(pos[i]<r)
			sy-=a[i][1];
		del[pos[i]]=1;
		while(r<=n&&((sy+b[i].v)*(1.0/b[i].p)<=sx*x||del[r]))
		{
			if(!del[r])
			{
				sy+=b[r].v;
				st.push_back(r);
			}
			r++;
		}
		while(st.size()&&del[st.back()])
			st.pop_back();
		y=(st.empty()?0:(1.0/b[st.back()].p));
		ans=max(ans,sx+sy-max(sx*x,sy*y));
		if(r<=n&&(!del[r]))
			ans=max(ans,sx+sy+b[r].v-max(sx*x,(sy+b[r].v)*(1.0/b[r].p)));
	}
	cout<<ans<<"\n";
}
signed main()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	cout<<fixed<<setprecision(12);
	int T=1;
//	cin>>T;
	while(T--)
	{
		O_o();
	}
}