#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;

int A[110];

int main()
{
	int N;
	bool flag = 1;
	cin >> N;

	vector<pi> q;

	for (int i = 0; i < N; i++) {
		cin >> A[i];
	}

	for (int i = 0; flag; i++) {
		flag = 0;
		for (int j = N-1; j >= i; j--) {
			if (A[j - 1] > A[j]) {
				swap(A[j-1],A[j]);
				q.push_back({j-1,j});
				flag = 1;
			}
		}
	}

	printf("%d\n",q.size());
	for (int i = 0; i < q.size(); i++) {
		printf("%d %d\n",q[i].first,q[i].second);
	}
	fflush(stdout);

	int damy;
	cin >> damy;

	return	0;
}