Niebieskie ksi.eczki
II Olympiad in Informatics 1994/1995

Task: SZE
Author: Marcin Jurdziński
Job Scheduling

III stage contest  

We are given n independent and indivisible jobs numbered from 1 to n. They should be executed sequentially in any order. The later the execution of a job starts the longer it lasts - precisely, the time of execution of the job i is hi(t)=ait+bi, if we start it in the moment t. We assume that 0<=ai<=1, 0<=bi<=1.

The goal is to schedule the jobs so that the total execution time is the shortest.

Task

Write a program that:

Input

Output

One should write in the file SZE.OUT the scheduling of the jobs, i.e. an appropriate permutation of numbers 1,...,n; one number per line.

Example

For the file SZE.IN:
5
0.002000 0.003000
0.016000 0.001000
0.100000 0.300000
0.016000 0.005000
0.030000 0.060000
in the file SZE.OUT one should write:
2
4
1
5
3
Your program should look for the file SZE.IN in the current directory and create the file SZE.OUT also in the current directory. The source file containing the program written by you should be named SZE.???, where ??? are substituted by at most three-letter abbreviation of the programming language used. The same program in an executable form should be written in a file SZE.EXE.