#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
    int n;cin>>n;
    vector<int> A(n),B(n),C(n);
    for(int i = 0; n > i; i++){
        cin>>A[i];
        B[i] = A[i];
        C[i] = A[i];
    }
    sort(B.begin(),B.end());
    vector<pair<int,int>> ret;
    for(int i = 0; n > i; i++){
        for(int j = i; n > j; j++){
            if(B[i] == A[j]){
                if(i!=j){
                    ret.push_back({i,j});
                    swap(A[i],A[j]);
                }
                break;
            }
        }
    }
    for(int i = 0; n > i; i++){
      A[i] = C[i];
    }
    sort(B.begin(),B.end(),greater<int>());
    vector<pair<int,int>> ret2;
    for(int i = 0; n > i; i++){
        for(int j = i; n > j; j++){
            if(B[i] == A[j]){
                if(i!=j){
                    ret2.push_back({i,j});
                    swap(A[i],A[j]);
                }
                break;
            }
        }
    }
    if(ret.size() < ret2.size()){
        cout << ret.size() << endl;
        for(int i = 0; ret.size() > i; i++){
            cout << ret[i].first << " " << ret[i].second << endl;
        }
    }else{
        cout << ret2.size() << endl;
        for(int i = 0; ret2.size() > i; i++){
            cout << ret2[i].first << " " << ret2[i].second << endl;
        }
    }
    int dm;cin>>dm;
    return 0;
}