#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <bitset>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
using namespace std;
typedef long long ll;
typedef pair<int,int> pint;
typedef vector<int> vint;
typedef vector<pint> vpint;
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)

int a[101];
int n;

void sort(void){
	vpint ans;
	bool zerof = 1;
	bool flag = 1;
	for (int i = 0; flag; ++i){
		flag = 0;
		for (int j = n - 1; j >= i ; --j){
			if(a[j] < a[j - 1]){
				swap(a[j], a[j - 1]);
				ans.push_back(mp(j - 1, j));
				flag = 1;
				zerof = 0;
			}
		}
	}
	//rep(i, n) printf("%d", a[i]);
	int size = ans.size(); printf("%d\n", size);
	rep(i, size) printf("%d %d\n", ans[i].fi, ans[i].se);
	return;
}
int main(void){
	cin >> n;
	rep(i, n) cin >> a[i];
	sort();
	int d;
	cin >> d;
	return 0;

}