#include<bits/stdc++.h>
using namespace std;
long long n;
struct st{
	int g,t;
}a[2010];
bool cmp(st x,st y){
	if(x.g==y.g){
		return	x.t<y.t;
	}
	return x.g>y.g;
}
int main(){
	freopen("stable.in","r",stdin);
	freopen("stable.out","w",stdout); 
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i].g;
		a[i].t=i;
	}//直接用结构体就行 
	sort(a+1,a+1+n,cmp);
	for(int i=1;i<=n;i++){
		cout<<a[i].g<<" "<<a[i].t<<" "; 
	} 
	return 0;
}