#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    int n;
    cin >> n;

    int a[n] = {};
    rep(i,n) cin >> a[i];

    vector<P> v;
    rep(i,1000){
        rep(j,n-1){
            if(a[j]>a[j+1]){
                v.push_back(P(j,j+1));
                swap(a[j],a[j+1]);
            }
        }
    }    
    int ans = v.size();
    cout << ans << endl;
    rep(i,ans) cout << v[i].first << ' ' << v[i].second << endl;
    fflush(stdout);
    int dummy;
    cin >> dummy;
    return 0;
}