#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int INF = 1e9;
int MOD = 1e9+7;
main(){
    int N;
    cin >> N;
    int A[N];
    vector<pair<int,int> > ans;
    for(int i = 0;i < N;i++)cin >> A[i];
    for(int i = 0;i < N;i++){
        for(int j = 0;j+1 < N;j++){
            if(A[j] > A[j+1]){
                ans.push_back(make_pair(j,j+1));
                swap(A[j],A[j+1]);
            }
        }
    }
    cout << ans.size() << endl;
    for(auto p:ans){cout << p.first << " " << p.second << endl;fflush(0);}
    cin >> N;
}