#include <bits/stdc++.h>
using namespace std;
unsigned long long min(unsigned long long x, unsigned long long y) {
  if (x < y) return x;
  return y;
}
unsigned long long max(unsigned long long x, unsigned long long y) {
  if (x < y) return y;
  return x;
}
long long min(long long x, long long y) {
  if (x < y) return x;
  return y;
}
long long max(long long x, long long y) {
  if (x < y) return y;
  return x;
}
double min(double x, double y) {
  if (x < y) return x;
  return y;
}
double max(double x, double y) {
  if (x < y) return y;
  return x;
}
unsigned long long gcd(unsigned long long x, unsigned long long y) {
  if (!x) return y;
  if (!y) return x;
  if (x > y) swap(x, y);
  return gcd(x, y % x);
}
unsigned long long inv(unsigned long long a, unsigned long long c) {
  if (a == 1) {
    return 1;
  }
  return ((c - (c / a)) * inv(c % a, c)) % c;
}
void SWAP(int i, int j, vector<int> &p, vector<int> &pos,
          vector<pair<int, int> > &ans) {
  ans.push_back(make_pair(i + 1, j + 1));
  pos[p[i]] = j;
  pos[p[j]] = i;
  swap(p[i], p[j]);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int n;
  cin >> n;
  vector<int> p(n, 0), pos(n, 0);
  for (int i = 0; i < n; i++) {
    cin >> p[i];
    p[i]--;
    pos[p[i]] = i;
  }
  vector<pair<int, int> > ans;
  for (int i = 0; i < n; i++) {
    if (p[i] == i) continue;
    int j = pos[i];
    if ((j - i) * 2 >= n) {
      SWAP(i, j, p, pos, ans);
      continue;
    }
    if ((n - 1 - j) * 2 >= n) {
      SWAP(n - 1, j, p, pos, ans);
      SWAP(n - 1, i, p, pos, ans);
    } else {
      SWAP(0, j, p, pos, ans);
      if (i * 2 >= n) {
        SWAP(0, i, p, pos, ans);
      } else {
        SWAP(0, n - 1, p, pos, ans);
        SWAP(i, n - 1, p, pos, ans);
      }
      SWAP(0, j, p, pos, ans);
    }
  }
  cout << ans.size() << "\n";
  for (int i = 0; i < ans.size(); i++) {
    cout << ans[i].first << " " << ans[i].second << "\n";
  }
  return 0;
}
