#include <bits/stdc++.h>
using namespace std;
int n,b[111111];
bool c[111111];
priority_queue <int ,vector <int>,greater <int> > a;
int main(){
	cin>>n;
	for (int i=1;i<=n;i++){
		cin>>b[i];
		a.push(b[i]);
	}
	for (int i=1;i<=n;i++){
		cout<<a.top()<<' ';
		for (int j=n;j>=1;j--){
			if (c[j]==false&&a.top()==b[j]) {
				cout<<j<<endl;
				c[j]=true;
				break;
			}
		}
		a.pop();
	}
	return 0;
}