There are n old trees planted along a road that goes from the top of a hill to its bottom. Local government decided to cut them down. In order not to waste wood each tree should be transported to a sawmill.

Trees can be transported only in one direction: downwards. There is a sawmill at the lower end of the road. Two additional sawmills can be built along the road. You have to decide where to build them, as to minimize the cost of transportation. The transportation costs one cent per meter, per kilogram of wood.

Input

The first line of the input contains one integer n - the number of trees (2 ≤ n ≤ 20,000). The trees are numbered 1, 2, ..., n, starting from the top of the hill and going downwards. Each of the following n lines contains two positive integers separated by single space. Line i + 1 contains: w_i - weight (in kilograms) of the i-th tree and d_i - distance (in meters) between trees number i and i + 1, 1 ≤ w_i ≤ 10,000, 1 ≤ d_i ≤ 10,000. The last of these numbers, d_n, is the distance from the tree number n to the lower end of the road. It is guaranteed that the total cost of transporting all trees to the sawmill at the end of the road is less than 2,000,000,000 cents.

Output

The first and only line of output should contain one integer: the minimum cost of transportation.

Example

Input:
9
1 2
2 1
3 3
1 1
3 2
1 6
2 1
1 2
1 1

Output:
26