#include <bits/stdc++.h>
const long long inf = (long long)(1e18 + 7);
using namespace std;
int n;
int a[300010];
int p[300010];
vector<pair<int, int>> ans;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &a[i]);
    p[a[i]] = i;
  }
  for (int i = 1; i <= n; ++i)
    if (a[i] != i) {
      int ca = i;
      int cb = p[i];
      if (2 * abs(cb - ca) >= n) {
        ans.emplace_back(ca, cb);
      } else if (cb <= n / 2) {
        ans.emplace_back(ca, n);
        ans.emplace_back(cb, n);
        ans.emplace_back(ca, n);
      } else if (ca > n / 2) {
        ans.emplace_back(ca, 1);
        ans.emplace_back(cb, 1);
        ans.emplace_back(ca, 1);
      } else {
        ans.emplace_back(ca, n);
        ans.emplace_back(cb, 1);
        ans.emplace_back(1, n);
        ans.emplace_back(ca, n);
        ans.emplace_back(cb, 1);
      }
      int t = a[i];
      a[ca] = i;
      a[cb] = t;
      p[a[ca]] = ca;
      p[a[cb]] = cb;
    }
  printf("%d\n", ans.size());
  for (int i = 0; i < ans.size(); ++i)
    printf("%d %d\n", ans[i].first, ans[i].second);
  return 0;
}
