#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cmath>
#include <stack>
#include <queue>
#include <cctype>
#include <stdio.h>
#include <map>
#include <string.h>
#include <utility>

typedef long long ll;


using namespace std;

int kadomatsu[101];

int main() {

	int m=0;
	cin>>m;

	for(int i=0; i<m;i++){
		int tmp=0;
		cin>>tmp;
		kadomatsu[i] = tmp;
	}

	bool judge = true;

	int a=0;



	vector<pair<int,int> > ans;

	while(judge){

		judge = false;

		for(int i=0; i<m-1; i++){
			if(kadomatsu[i] > kadomatsu[i+1]){
				int tmp = kadomatsu[i];
				kadomatsu[i] = kadomatsu[i+1];
				kadomatsu[i+1] = tmp;

				judge = true;
				a++;

				pair<int , int> p(i,i+1);

				ans.push_back(p);
			/*	cout<<i<<" "<<i+1<<endl;*/
			}
		}

	}
	if(a ==0){
		cout<<0<<endl;
	}else {
		cout<<ans.size()<<endl;
		for(int i=0; i<ans.size(); i++){

			cout<<ans[i].first<<" "<<ans[i].second<<endl;
		}
	}

	int b;
	cin>>b;


	return 0;
}