#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int n;
void  bubblesort(vector<int> &a) {
	bool flag = 1;
	for (int i = 0; flag; i++) {
		flag = 0;
		for (int j = n - 1; j >= i + 1; j--) {
			if (a[j] < a[j - 1]) {
				cout << j << " " << j - 1 << endl;
				swap(a[j], a[j - 1]);
				flag = 1;
			}
		}
	}
}

int main() {
	vector<int> a;
	cin >> n;
	a.resize(n);
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}

	bubblesort(a);

	return 0;
}