#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main() {
    int n;
    cin>>n;
    int a[n];
    for (int i=0;i<n;i++) cin>>a[i];
    vector<int> b;
    for (int i=0;i<n;i++)
        for (int j=n-1;j>i;j--)
            if (a[j-1]>a[j]) {
                b.push_back(j-1);
                swap(a[j-1],a[j]);
            }
    cout<<b.size()<<endl;
    for (int x:b) cout<<x<<' '<<x+1<<endl;
    int d;cin>>d;
    return 0;
}