#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>

#define REP(i,n) for(long (i)=0;(i)<(n);(i)++)
#define FOR(i,a,b) for(long (i)=(a);(i)<(b);(i)++)
#define RREP(i,a) for(long (i)=(a)-1;(i)>=0;(i)--)
#define FORR(i,a,b) for(long (i)=(a)-1;(i)>=(b);(i)--)
#define PI acos(-1.0)
#define DEBUG(C) cout<<C<<endl;
#define VI vector<int>
#define VL vector<long>
#define VD vector<double>
#define PII pair<int,int>
#define PDD pair<double,double>
#define PLL pair<long,long>
#define ALL(a) (a).begin(),(a).end()
#define SORT(a) sort(ALL(a))
#define REVERSE(a) reverse(ALL(a))
#define MP make_pair
#define FORE(a,b) for(auto &&a:b)

using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
const int INF=1e9;
const int MOD=INF+7;

void vecout(VI a){
    REP(i,a.size()) cout<<a[i]<<" ";
    cout<<endl;
}

int main(void)
{
    int N; cin>>N;
    VI A(N); REP(i,N) cin>>A[i];
    vector<PII> ans;
    RREP(i,N)FOR(j,i+1,N){
        if(A[j-1]>A[j]){
            swap(A[j-1],A[j]);
            ans.emplace_back(MP(j-1,j));
        }
    }
    //vecout(A);
    cout<<ans.size()<<endl;
    FORE(el,ans){
        cout<<el.first<<" "<<el.second<<endl;
    }
    scanf("%*d");
    fflush(stdout);
    return 0;
}