The haulage contractor carries packages from town A to town B. Packages are transported by cars. Petrol stations along the route offer petrol at various prices. The first station is situated at the beginning of the route. All cars, which the contractor has at his disposal, use one standard unit of petrol per mile but capacities of their fuel tanks can differ. Cost of petrol needed to cover the distance from A to B depends on the capacity of the tank in a car and the chosen plan of refuelling. We assume that each petrol station has enough petrol to fill up a fuel tank of every car. Petrol stations are placed in such a way that each car can travel from A to B.

Task

• reads the following data from the text file PAL.IN:
  • the capacity of the fuel tank in a car,
  • the number of petrol stations on the route from A to B,
  • the price of petrol at each station and the distances between consecutive stations,
• computes the minimal cost of refuelling on the route AB for the car with the given capacity of the fuel tank,
• writes the result to the text file PAL.OUT.

Input

In the second line of the same file there is an integer n, 1 < n <= 1000000 - the number of petrol stations on the route from A to B.

In each of the following n lines there is a pair of positive integers c_i, d_i, separated by a single space. The number c_i is the price of a standard petrol unit at the i-th station (the numbers of petrol stations increase when we go away from A). The number d_i is the distance (in miles) between the i-th and the (i+1)-st station (d_n is the distance from the last station to the end of the route AB). The numbers meet the following conditions: 1 <= c_i <= 1000, 1 <= d_i <= 1000000.

The length of the route AB (the sum of d_i) is not greater than 1000000.

Output

Example

40
3
2 10
1 15
2 5

40