#include "bits/stdc++.h"

using namespace std;

using ll = long long int;
using ld = long double;

using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vd = vector<double>;
using vvd = vector<vd>;
using vs = vector<string>;
using vb = vector<bool>;
using vvb = vector<vb>;

const int INF = (1 << 30) - 1;
const ll INF64 = ((ll)1 << 62) - 1;
const double PI = 3.1415926535897932384626433832795;

const int dx[] = { -1, 0, 1, 0 };
const int dy[] = { 0, 1, 0, -1 };

int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int lcm(int x, int y) { return x / gcd(x, y) * y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }

int n;
vi a;

vector<pair<int, int>> solve() {
	vector<pair<int, int>> res;
	bool flag = true;
	for (int i = 0; flag; i++) {
		flag = false;
		for (int j = n - 1; j >= i + 1; j--) {
			if (a[j] < a[j - 1]) {
				swap(a[j], a[j - 1]);
				res.push_back(make_pair(j - 1, j));
				flag = true;
			}
		}
	}

	return res;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> n;

	a.resize(n);

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

	int dummy;
	cin >> dummy;

	vector<pair<int, int>> res = solve();

	cout << res.size() << endl;
	for (auto p : res) {
		cout << p.first << " " << p.second << endl;
	}
	cout << flush;
	return 0;
}