Codeforces Round 312 (Div. 2) |
---|

Finished |

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

brute force

implementation

sortings

*1100

No tag edit access

The problem statement has recently been changed. View the changes.

×
A. Lala Land and Apple Trees

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputAmr lives in Lala Land. Lala Land is a very beautiful country that is located on a coordinate line. Lala Land is famous with its apple trees growing everywhere.

Lala Land has exactly *n* apple trees. Tree number *i* is located in a position *x*_{i} and has *a*_{i} apples growing on it. Amr wants to collect apples from the apple trees. Amr currently stands in *x* = 0 position. At the beginning, he can choose whether to go right or left. He'll continue in his direction until he meets an apple tree he didn't visit before. He'll take all of its apples and then reverse his direction, continue walking in this direction until he meets another apple tree he didn't visit before and so on. In the other words, Amr reverses his direction when visiting each new apple tree. Amr will stop collecting apples when there are no more trees he didn't visit in the direction he is facing.

What is the maximum number of apples he can collect?

Input

The first line contains one number *n* (1 ≤ *n* ≤ 100), the number of apple trees in Lala Land.

The following *n* lines contains two integers each *x*_{i}, *a*_{i} ( - 10^{5} ≤ *x*_{i} ≤ 10^{5}, *x*_{i} ≠ 0, 1 ≤ *a*_{i} ≤ 10^{5}), representing the position of the *i*-th tree and number of apples on it.

It's guaranteed that there is at most one apple tree at each coordinate. It's guaranteed that no tree grows in point 0.

Output

Output the maximum number of apples Amr can collect.

Examples

Input

2

-1 5

1 5

Output

10

Input

3

-2 2

1 4

-1 3

Output

9

Input

3

1 9

3 5

7 10

Output

9

Note

In the first sample test it doesn't matter if Amr chose at first to go left or right. In both cases he'll get all the apples.

In the second sample test the optimal solution is to go left to *x* = - 1, collect apples from there, then the direction will be reversed, Amr has to go to *x* = 1, collect apples from there, then the direction will be reversed and Amr goes to the final tree *x* = - 2.

In the third sample test the optimal solution is to go right to *x* = 1, collect apples from there, then the direction will be reversed and Amr will not be able to collect anymore apples because there are no apple trees to his left.

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/21/2024 08:19:56 (l3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|