根据一个古老的传说，很久以前，安克-莫波克的居民做了一件对不起“财富”小姐的事情，于是她诅咒他们。她说，在某个时候，会有N种大小不一的点心落在城市里，居民们需要把这些点心一个一个地放在一起，建立一座点心塔。当然，大点心应该在塔底，而小点心应该在塔顶。
几年过去了，一旦不同的点心开始落在城市里，居民们就开始建造点心塔。
然而，他们遇到了一些麻烦。每一天都有一个零食落在城市里，但它们的顺序很奇怪。因此，在某些日子里，居民们无法将新的点心堆放在点心塔的顶端：他们必须等到所有较大的点心落下。当然，为了不再次激怒“财富”小姐，居民们在他们能做到的情况下，尽快将点心放在塔顶。
According to an old legeng, a long time ago Ankh-Morpork residents did something wrong to miss Fortune, and she cursed them. She said that at some time n snacks of distinct sizes will fall on the city, and the residents should build a Snacktower of them by placing snacks one on another. Of course, big snacks should be at the bottom of the tower, while small snacks should be at the top.
Years passed, and once different snacks started to fall onto the city, and the residents began to build the Snacktower.
me troubles. Each day exactly one snack fell onto the city, but their order was strange. So, at some days the residents weren't able to put the new stack on the top of the Snacktower: they had to wait until all the bigger snacks fell. Of course, in order to not to anger miss Fortune again, the residents placed each snack on the top of the tower immediately as they could do it.
Write a program that models the behavior of Ankh-Morpork residents.
Output
Print
n lines. On the
i-th of them print the sizes of the snacks which the residents placed on the top of the Snacktower on the
i-th day in the order they will do that. If no snack is placed on some day, leave the corresponding line empty.
Note
In the example a snack of size
3 fell on the first day, and the residents immediately placed it. On the second day a snack of size
1 fell, and the residents weren't able to place it because they were missing the snack of size
2. On the third day a snack of size
2 fell, and the residents immediately placed it. Right after that they placed the snack of size
1 which had fallen before.