/* -*- coding: utf-8 -*-
 *
 * 397.cc: No.397 NO MORE KADOMATSU - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 100;
const int INF = 1 << 30;

/* typedef */

typedef pair<int,int> pii;
typedef vector<pii> vpii;

/* global variables */

int as[MAX_N];

/* subroutines */

/* main */

int main() {
  int n;
  cin >> n;

  for (int i = 0; i < n; i++) cin >> as[i];

  vpii ans;
  for (int i = 0; i < n; i++) {
    int minb = INF, minj = -1;
    for (int j = i; j < n; j++)
      if (minb > as[j]) minb = as[j], minj = j;
    if (i != minj) {
      ans.push_back(pii(i, minj));
      swap(as[i], as[minj]);
    }
  }
  //for (int i = 0; i < n; i++) printf("%d ", as[i]); putchar('\n');

  printf("%lu\n", ans.size());
  for (int i = 0; i < ans.size(); i++)
    printf("%d %d\n", ans[i].first, ans[i].second);
  cout.flush();

  int x;
  cin >> x;
  return 0;
}