A. Snacktower

time limit per test:2 seconds

memory limit per test:256 megabytes

input:standard input

output:standard output

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.

However, they faced some 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.

Input

The first line contains single integer n (1 ≤ n ≤ 100 000) — the total number of snacks.

The second line contains n integers, the i-th of them equals the size of the snack which fell on the i-th day. Sizes are distinct integers from 1 to n.

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.

Examples

Input

```3
3 1 2```

Output

```3

2 1```

Input

```5
4 5 1 2 3```

Output

```5 4

3 2 1```

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.

``` 1 #include <bits/stdc++.h>
2 using namespace std;
3 const int N=100020;
4 int a[N]={0};
5 int main()
6 {
7     int n;
8     scanf("%d",&n);
9     int m=n;
10     for(int i=0;i<n;i++)
11     {
12         int p;
13         cin>>p;
14         a[p]=1;////对各个位置数进行标记，实际上在进行着排序
15         while(a[m]==1)
16         {
17             printf("%d ",m);
18             m--;
19         }
20         printf("\n");
21     }
22     return 0;
23 }```

793 篇文章63 人订阅

0 条评论

相关文章

14710

11220

7620

28440

22570

编写高质量代码改善C#程序的157个建议[为泛型指定初始值、使用委托声明、使用Lambda替代方法和匿名方法]

泛型并不是C#语言一开始就带有的特性，而是在FCL2.0之后实现的新功能。基于泛型，我们得以将类型参数化，以便更大范围地进行代码复用。同时，它减少了泛型类及...

9450

13040

宽字符编码和解码通用类[CodeWidthChartUtility]

在做jsonp传递的时候遇到一个问题，当有特殊字符或中文的时候就会导致数据错误或者是乱码，刚开始有js的编码和解码和正则，都比较麻烦，现在找到了一种合适的解...

32480

12220

C#系列之String和StringBuilder

首先和博园的各位打声招呼，小弟在博园呆了也有一年多了。平常一有时间就会过来看看文章，学习各位的经验，现在养成了一种一天不来博园，心里就不踏实的习惯，...

12540