Dura Lex#7266

Dura Lex

1 second
256 megabytes
Easy

Alex loves to order gadgets from abroad. Unfortunately for Alex, new customs regulations have been recently introduced, and according to them, he needs passes to receive each gadget. Every pass is hard to get — to get -th pass, Alex needs to spend D_i days in a queue, and he can only request one pass at a time. The most annoying part is that the request for the -th pass can be denied with probability P_i%, absolutely randomly, and moreover, if one pass request is denied, all the others get annulled automatically and Alex has to start it all over again. There is only one good thing about it — Alex can get passes in whatever order he wants.

Alex wants to get a new gadget by all means. He will try to get all the passes until he has them all. Help him select the order of requesting the passes so that the average time needed to collect them all will be minimum.

Input

The first line of the input file contains an integer .

Next, lines contain two integers each: D_i and P_i.

1 \le N \le 10^5

0 \le D_i \le 1000

0 \le P_i < 100

Output

Print integers from to — desired order. If there are several optimal orders, print the lexicographically minimal.

Examples

Example 1

Loading
Loading