#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;

int n;
vector<pair<int, int> > ans;

int bubblesort(vector<int> &a) {
	int cnt = 0;
	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]) {
				ans.push_back(make_pair(j, j - 1));
				swap(a[j], a[j - 1]);
				flag = 1;
				cnt++;
			}
		}
	}
	return cnt;
}

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

	cout << bubblesort(a) << endl;
	for (int i = 0; i < ans.size(); i++) {
		cout << ans[i].first << " " << ans[i].second << endl;
	}

	return 0;
}