#include <bits/stdc++.h>

#define MAXN 200'100

using namespace std;

int a[MAXN], b[MAXN];

int main()
{
	cin.tie(NULL);
	ios_base::sync_with_stdio(false);
	
    int n;
    cin >> n;

    for (int i = 0; i<n; ++i)
        cin >> a[i], b[i] = a[i];
    sort(b,b+n,std::greater<int>());
    int cur_size = 0;
    set<int> s;
    for (int i = 0; i<n; ++i)
    {
        s.insert(a[i]);
        while (s.find(b[cur_size]) != s.end())
            cout << b[cur_size++] << ' ';
        cout << endl;
    }
}