#include<bits/stdc++.h>
using namespace std;
int n,a[200001],cnt,b[200001];
queue<int>q;
int main(){
	cin>>n;
	a[0]=-1;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		if(a[i]!=a[i-1]){
			cnt++;
			b[i]=1;
			q.push(i);
		}
	}
	while(q.size()){
		cout<<q.front()<<" ";
		q.pop();
	}
	cout<<endl;
	while(cnt<n){
		int x=0;
		for(int i=1;i<=n;i++){
			if(b[i]==0&&a[x]!=a[i]){
				cout<<i<<" ";
				cnt++;
				x=i;
				b[i]=1;
			}else if(b[i]==0){
				x=i;
			}
		}
		cout<<endl;
	}
	return 0;
}