#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,b) FOR(i,0,b)
#define ALL(c) c.begin(),c.end()
#define PB push_back
#define TT second.second
#define SS second.first
#define FF first
using namespace std;
typedef long double ld;
typedef long long LL;
typedef int ut;
typedef vector<ut> VI;
typedef pair<ut,ut> pr;
typedef pair<ut,pr> ppr;
typedef vector<pr> Vpr;
typedef priority_queue<pr,Vpr,greater<pr> > PQ;
const int INF=1<<30;
const int BITSIZE=1<<12;
const int SIZE=10+2*1e4;
Vpr nums,sorts;
int times=0;
bool outs(const pr& a,const pr& b){
	if(a<b){
	cout << a.second <<" "<< b.second << endl;
		return true;
	}
	return false;
}
bool counts(const pr& a,const pr& b){
	if(a<b){
		times++;
		return true;
	}
	return false;
}
int main(){
	int N;
	ld x;
	cin >> N;
	REP(i,N){
		cin >> x;
		nums.PB(pr(x,i));
		sorts.PB(pr(x,i));
	
	}
	REP(j,N)
	REP(i,N-1){
		if(nums[i]<nums[i+1]){
			swap(nums[i],nums[i+1]);
			cout << i <<" " << i+1 << endl;
		} 
	}
	cin >> x;
	
	return 0;
}