#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> static void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> static void amax(T &x, U y) { if(x < y) x = y; }

struct S {
	int i;
	int x;
	bool operator<(S t) { return x < t.x; }
};
vpii ans;
void swap(S &x, S &y) {
	ans.emplace_back(x.i, y.i);
	swap(x.x, y.x);
	swap(x.i, y.i);
}

int main() {
	int N;
	while(~scanf("%d", &N)) {
		vector<S> A(N);
		for(int i = 0; i < N; ++ i) {
			int x;
			scanf("%d", &x);
			A[i] = { i, x };
		}
		ans.clear();
		rep(k, N) {
			rep(i, N - 1) if(A[i + 1] < A[i])
				swap(A[i], A[i + 1]);
		}
		printf("%d\n", (int)ans.size());
		for(int i = 0; i < (int)ans.size(); ++ i)
			printf("%d %d\n", ans[i].first, ans[i].second);
		fflush(stdout);
		int dummy;
		scanf("%d", &dummy);
	}
	return 0;
}