#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
using llu = long long unsigned;
using ld = long double;
const ld EPS = 1e-9;
inline int cmp(ld first, ld second = 0, ld tol = EPS) {
  return (first <= second + tol) ? (first + tol < second) ? -1 : 0 : 1;
}
const int MOD = 1;
inline int mod(ll first, int m = MOD) { return (int)(((first % m) + m) % m); }
const int N = 3e5 + 100;
int n;
int a[N], pos[N];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    pos[a[i]] = i;
  }
  vector<pii> ans;
  for (int i = 2; i < n; i++)
    if (pos[i] != i) {
      if (pos[i] != 1 and pos[i] != n) {
        if (pos[i] <= n / 2) {
          pos[a[n]] = pos[i];
          swap(a[pos[i]], a[n]);
          ans.push_back({pos[i], n});
          pos[i] = n;
        } else {
          pos[a[1]] = pos[i];
          swap(a[pos[i]], a[1]);
          ans.push_back({pos[i], 1});
          pos[i] = 1;
        }
      }
      if (i > n / 2 and pos[i] == n) {
        swap(a[1], a[n]);
        ans.push_back({1, n});
      }
      if (i <= n / 2 and pos[i] == 1) {
        swap(a[1], a[n]);
        ans.push_back({1, n});
      }
      if (i > n / 2) {
        swap(a[1], a[i]);
        ans.push_back({1, i});
      } else {
        swap(a[n], a[i]);
        ans.push_back({n, i});
      }
      pos[a[1]] = 1;
      pos[a[n]] = n;
      pos[a[pos[i]]] = pos[i];
      pos[i] = i;
    }
  if (a[1] != 1) ans.push_back({1, n});
  printf("%d\n", ((int)(ans).size()));
  for (auto p : ans) printf("%d %d\n", p.first, p.second);
  return 0;
}
