#include<bits/stdc++.h>

using namespace std;
typedef long long int ll;

#define debugv(v) printf("L%d %s => ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;
#define debugm(m) printf("L%d %s is..\n",__LINE__,#m);for(auto v:m){for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) printf("L%d %s is => ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;
#define debugaa(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[x][y]<<" ";}cout<<endl;}
#define ALL(v) (v).begin(),(v).end()
#define BIGINT 0x7FFFFFFF
#define E107 1000000007

template<typename T1,typename T2>
ostream& operator <<(ostream &o,const pair<T1,T2> p){o<<"("<<p.first<<":"<<p.second<<")";return o;}

int data[101];

inline bool kadomatu(int a,int b,int c){
    return a!=b&&b!=c&&c!=a&&((a<b && c<b)||(a>b && c>b));
}

template<typename TI>
bool kadomaturetu(TI begin,TI end){
    TI it1=begin;
    TI it2=++begin;
    TI it3=++begin;
    for (;it3!=end;it1=it2,it2=it3,it3++){
        if (!kadomatu(*it1,*it2,*it3)) return false;
    }
    return true;
}

int main(){
    int i,j;
    int n;

    cin >> n;

    vector<int> order(n);
    for (i=0;i<n;i++){
        order[i]=i+1;
        scanf("%d",data+i);
    }

    // ソート比較
    stable_sort(order.begin(),order.end(),[](int l,int r){return data[l-1]<data[r-1];});

    vector<int> v(n);

    for (i=0;i<n;i++)
        v[order[i]-1]=i;

    queue<pair<int,int>> result; 
    for (i=0;i<n-1;i++){
        for (j=i;j<n;j++){
            if (v[j]==i){
                if (i!=j){
                    result.push(make_pair(i,j));
                    swap(v[i],v[j]);
                    swap(data[v[i]],data[v[j]]);
                    if (kadomaturetu(data,data+n)) goto l_superbreak;
                }
                break;
            }
        }
    }
l_superbreak:

    cout<<result.size()<<endl;
    
    while (!result.empty()){
        printf("%d %d\n",result.front().first,result.front().second);
        result.pop();
    }
    cout<<endl;
    cin>>n;

    return 0;

}