Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-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.

No tag edit access

B. Checkout Assistant

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputBob came to a cash & carry store, put *n* items into his trolley, and went to the checkout counter to pay. Each item is described by its price *c*_{i} and time *t*_{i} in seconds that a checkout assistant spends on this item. While the checkout assistant is occupied with some item, Bob can steal some other items from his trolley. To steal one item Bob needs exactly 1 second. What is the minimum amount of money that Bob will have to pay to the checkout assistant? Remember, please, that it is Bob, who determines the order of items for the checkout assistant.

Input

The first input line contains number *n* (1 ≤ *n* ≤ 2000). In each of the following *n* lines each item is described by a pair of numbers *t*_{i}, *c*_{i} (0 ≤ *t*_{i} ≤ 2000, 1 ≤ *c*_{i} ≤ 10^{9}). If *t*_{i} is 0, Bob won't be able to steal anything, while the checkout assistant is occupied with item *i*.

Output

Output one number — answer to the problem: what is the minimum amount of money that Bob will have to pay.

Examples

Input

4

2 10

0 20

1 5

1 3

Output

8

Input

3

0 1

0 10

0 100

Output

111

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/27/2018 08:05:54 (d3).

Desktop version, switch to mobile version.

User lists

Name |
---|