#include <bits/stdc++.h>
using namespace std;
const int MAXN = 300008;
const long long inf = 1000000001;
const long long INF = 2e18;
const long double EPS = 1e-7;
const long long mod = inf + 6;
const int moff = 998244353;
const int mod13 = 1000003;
const long double PI = acos(-1.0);
vector<pair<int, int>> op;
int n;
void swp(int i, int j) {
  if (2 * abs(i - j) >= n) {
    op.push_back({i, j});
    return;
  }
  if (i < n / 2 && j < n / 2) {
    op.push_back({i, n - 1});
    op.push_back({j, n - 1});
    op.push_back({i, n - 1});
  } else if (i >= n / 2 && j >= n / 2) {
    op.push_back({0, i});
    op.push_back({0, j});
    op.push_back({0, i});
  } else {
    if (i > j) swap(i, j);
    op.push_back({i, n - 1});
    op.push_back({0, j});
    op.push_back({0, n - 1});
    op.push_back({0, j});
    op.push_back({i, n - 1});
  }
}
int pos[MAXN];
signed main() {
  ios_base::sync_with_stdio(0);
  cout.tie(0);
  cin.tie(0);
  ;
  cin >> n;
  vector<int> a(n);
  for (long long i = 0; i < a.size(); ++i) cin >> a[i];
  ;
  if (n == 2) {
    if (is_sorted((a).begin(), (a).end())) {
      cout << 0;
      return 0;
    } else {
      cout << 1 << '\n' << "1 2";
      return 0;
    }
  }
  priority_queue<int> s;
  for (int i = 0; i < n; ++i) {
    pos[a[i]] = i;
  }
  for (int i = 0; i < n; ++i) {
    if (i != a[i] - 1) {
      s.push(a[i]);
    }
  }
  while (s.size()) {
    int x = s.top();
    int j = x - 1;
    if (pos[x] == j) {
      s.pop();
      continue;
    }
    int kek = pos[x];
    swp(kek, j);
    pos[a[x - 1]] = pos[x];
    if (pos[a[x - 1]] != a[x - 1] - 1) {
      s.push(a[x - 1]);
    }
    a[pos[x]] = a[x - 1];
    a[x - 1] = x;
    pos[x] = x - 1;
    s.pop();
  }
  cout << op.size() << '\n';
  for (auto i : op) {
    cout << i.first + 1 << ' ' << i.second + 1 << '\n';
  }
}
