english-21 Teamwork

描述

There are N candidates. Each candidate has a cooperation value and a working value. Select a subset of candidates to form a team, such that the sum of cooperation values is positive and the sum of working values is maximum.

输入

First line: one positive integer N (N <= 100).Next N lines: the i-th line contains two integers (between -100 and 100), indicating the cooperation value and the working value of the i-th candidate.

输出

One line contains several integers, indicating the indexes of selected candidates.

样例输入

1
2
3
44
2 -1
4 -2
1 1

样例输出

12 3 4

限制

• 时间限制：1000ms
• 内存限制：128MB