#include<bits/stdc++.h>
#include<bits/extc++.h>
#define int long long
#define inf 0x3f3f3f3f3f3f3f3f
#define maxn 1234567
#define eps 1e-7
#define mod 1000000007
#define Mod 998244353
#define f(i,a,b) for(int i=a;i<=b;i++)
#define r(i,a,b) for(int i=a;i>=b;i--) 
#define fx(i,a,b,x) for(int i=a;i<=b;i+=x)
#define rx(i,a,b,x) for(int i=a;i>=b;i-=x) 
using namespace std;
using namespace __gnu_cxx;
using namespace __gnu_pbds;
int T;
int n,a[maxn];
void Swap(int &a,int &b){
	a^=b^=a^=b;
	return;
}
vector<pair<int,int>>v;
void solve(){
	scanf("%lld",&n);
	f(i,1,n)scanf("%lld",&a[i]);
	f(i,1,n-1){
		f(j,1,n-1){
			if(a[j]>a[j+1]){
				Swap(a[j],a[j+1]);
				v.push_back(make_pair(j-1,j));
			}
		}
	}
	printf("%lld\n",v.size());
	for(auto [a,b]:v)printf("%lld %lld\n",a,b);
}
signed main(){
	T=1;
//	scanf("%lld",&t);
	while(T--)solve();
	return 0;
}