#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> P;

const ll INF = 1ll<<29;
const ll MOD = 1000000007;
const double EPS  = 1e-10;

int main() {
	int n;
	int a[100];
	cin >> n;
	REP(i, n) scanf("%d", a + i);
	
	vector<pii> ans;
	
	REP(i, n) FOR(j, 1, n - i) {
		if (a[j] > a[j - 1]) {
			ans.push_back(pii(j - 1, j));
			swap(a[j], a[j - 1]); 
		}
	}
	
	cout << ans.size() << endl;
	REP(i, ans.size()) printf("%d %d\n", ans[i].first, ans[i].second);
	fflush(stdout);
	
	int dummy;
	cin >> dummy;
	return 0;
}