eolymp
bolt
Try our new interface for solving problems
Problems

The vouchers

The vouchers

The tour operator did not sell n (n < 15) vouchers to mountain-ski resort because of the great frost. The terms of vouchers validity is already come. To reduce the losses, it was decided from the February 1, that all the vouchers for which remained dk (dk30) days, to sell for minimal cost – for ck (ck100) UAH for a day only for that days, which remained from the sale day (k = 1..n).

What is the largest amount of income can get the travel company selling these vouchers, if one voucher can be sold only in one day?

Input

The first line contains the number of vouchers n. Each of the next n lines contains two numbers - the number of days dk left and the cost of each day ck.

Output

The maximum amount of income.

Time limit 1 second
Memory limit 128 MiB
Input example #10
4
2 37
3 45
1 46
4 30
Output example #10
232