// シャロちゃんはっぴーばーすでー！！！！！！！！！！！！

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))

// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;

int n;
int a[125];
int b[125];

void putans(vector<pii> p){
  cout<<p.size()<<endl;
  REP(i,p.size()){
    cout<< p[i].first << " " << p[i].second << endl;
  }
}

int main(){
  scanf("%d",&n);
  REP(i,n)scanf("%d",a+i);
  REP(i,n)b[i]=a[i];

  vector<pii> ans;
  REP(i,n-1){
    int p = max_element(a+i,a+n)-a;
    if(p==i)continue;
    ans.push_back(pii(i,p));
    swap(a[i],a[p]);
  }
  REP(i,n)a[i]=b[i];
  vector<pii> ans2;
  REP(i,n-1){
    int p = min_element(a+i,a+n)-a;
    if(p==i)continue;
    ans2.push_back(pii(i,p));
    swap(a[i],a[p]);
  }

  if(ans.size()<ans2.size()){
    putans(ans);
  }else{
    putans(ans2);
  }

  // dummy
  scanf("%d",&n);
  return 0;
}