OGRADA

문제

Mirko built a wooden fence next to his house. He built his fence by slamming rectangular wooden boards into the ground. For each board we know its height, width and distance of its left edge from Mirko's house. 

Mirko was really enjoying building his fence, so much that he stopped paying attention as to how he was building it – now that he is done, some of the boards are overlapping, and there are holes in the fence, total chaos! 

Mirko is now looking at his fence and is shocked – he could have built a fence the same fence (when looked from up front) using fewer boards. If we connect the top sides of all boards as in the image below, we get the skyline of the fence. 

[이미지 1]

The second example input. The skyline is depicted by a bold line. 

Mirko decided to remove some of the boards from the fence so that the skyline remains the same and that as few boards as possible remain in the fence. 

Write a program that determines which boards should remain in the fence. 

입력

The first line contains an integer N (1 ≤ N ≤ 100 000), the number of boards initially in Mirko's fence. Each of the following N lines describes one board with three integers X, W and H; these are the distance of the left edge of the board from Mirko's house, width and height of the board, respectively. No two boards will share the same (X, W, H) triplet. All these numbers will be at most a billion (10⁹). 

Boards are numbered 1 to N. 

출력

On the first line output B, the smallest number of boards that need to remain for the skyline to stay the same. 

On the second line output B integers separated by spaces, the numbers of boards that should remain in the fence. This part of the output is not necessarily unique.