Problem: 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.

<image>

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.

Solution (in JAVA):

Solution:

import java.util.Scanner;
//20 min
//49 min
public class Solution {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
       Scanner input = new Scanner(System.in);
       int candys=input.nextInt();
       int list[]=new int[candys];
       int read=0;
       

       int ele_in=0;
       int ind=0;
       for (; candys!=0; ) {
            read=input.nextInt();
            
            if(read==candys){
                System.out.print(read);
                candys--;
                for (int j = candys-1; j >= 0 && candys!=0 && ele_in!=0; j--) {
                    if(list[j] == candys){
                        System.out.print(" "+list[j]);
                        candys--; 
                        ele_in--;
//                        ind--;
                    }else{
                        break;
                    }
                }
                
                
            }else{
//                if((read-1)>ind){
//              ind=read-1;
//                }
              list[read-1]=read;
              ele_in++;
                
            }
            System.out.println("");
            
        }
        
        
        
       
    
       
    }
    
    public static void sort(int a[]){
        int min=0;
        int minind=0;
        int temp=0;
        for (int i = 0; i < a.length; i++) {
            if(i==a.length-1){
                break;
            }
            min=a[i];
            minind=i;
            for (int j = i+1; j < a.length; j++) {
                if(a[j]<min){
                    min=a[j];
                    minind=j;
                }
            }
            temp=a[i];
            a[i]=a[minind];
            a[minind]=temp;
        }
    }
    public static char letters(int num) {
        switch (num) {
            case 0:
                return 'a';
            case 1:
                return 'b';
            case 2:
                return 'c';
            case 3:
                return 'd';
            case 4:
                return 'e';
            case 5:
                return 'f';
            case 6:
                return 'g';
            case 7:
                return 'h';
            case 8:
                return 'i';
            case 9:
                return 'j';
            case 10:
                return 'k';
            case 11:
                return 'l';
            case 12:
                return 'm';
            case 13:
                return 'n';
            case 14:
                return 'o';
            case 15:
                return 'p';
            case 16:
                return 'q';
            case 17:
                return 'r';
            case 18:
                return 's';
            case 19:
                return 't';
            case 20:
                return 'u';
            case 21:
                return 'v';
            case 22:
                return 'w';
            case 23:
                return 'x';
            case 24:
                return 'y';
            case 25:
                return 'z';
        }
      return's';
    }
    
    
    
}