#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<iostream>
#include<cmath>
#include<cctype>
#include<ctime>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])
#define Lson (x<<1)
#define Rson ((x<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (100000007)
#define MAXN (1000)
typedef long long ll;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return (a-b+(a-b)/F*F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int n;
pair<int,int> p[MAXN];
int main()
{
// freopen("A.in","r",stdin);
// freopen(".out","w",stdout);
cin>>n;
For(i,n) scanf("%d%d",&p[i].first,&p[i].second);
sort(p+1,p+1+n);
p[0]=p[n+1]=make_pair(-INF,-INF);
int p2=1;
while(p2<=n&&p[p2].first<0) ++p2;
if (p2>n)
{
cout<<p[n].second<<endl;return 0;
}
int s1,s2;
int len=min(s1=p2-1,s2=n-p2+1);
int ans=0;
For(i,len)
{
ans+=p[p2+i-1].second+p[p2-i].second;
}
int l=p2-len,r=p2+len-1;
if (l==1&&r<n) ans+=p[r+1].second;
if (r==n&&l>1) ans+=p[l-1].second;
if (l>1&&r<n) ans+=max(p[l-1].second,p[r+1].second);
cout<<ans<<endl;
return 0;
}