#include <bits/stdc++.h>
using namespace std;

const int N=2e5+5;

int n,a[N],s;

queue<int>e[N];

int main(){
//	freopen("fruit.in","r",stdin);
//	freopen("fruit.out","w",stdout);
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d",&a[i]);
		if(i==1){
			e[++s].push(i);
			continue;
		}
		if(a[i]==a[i-1]){
			e[s].push(i);
			continue;
		}
		e[++s].push(i);
	}
	while(1){
		int p=0,k=0;
		for(int i=1;i<=s;i++){
			if(e[i].size()){
				printf("%d ",e[i].front());
				e[i].pop();
				if(k==1){
					while(e[i].size()){
						e[i-2].push(e[i].front());
						e[i].pop();
					}
					p=1;
					continue;
				}
				k=0;
				p=1;
				if(e[i].empty()){
					k=1;
				}
			}
			
		}
		cout<<"\n";
		if(p==0)break;
	}




	return 0;
}