#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long inf = 1e18;
const double EPS = 1e-9;
void solve() {
  long long n;
  cin >> n;
  long long a[n + 1];
  long long b[n + 1];
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    b[a[i]] = i;
  }
  vector<pair<long long, long long> > ans;
  for (int curr = 1; curr <= n / 2; curr++) {
    long long curr_num = n / 2 + curr;
    long long curr_num_index = b[curr_num];
    if (curr_num_index != curr_num) {
      if (curr_num_index > n / 2) {
        ans.push_back({1, curr_num_index});
        b[a[1]] = curr_num_index;
        b[a[curr_num_index]] = 1;
        swap(a[curr_num_index], a[1]);
        ans.push_back({1, curr_num});
        b[a[1]] = curr_num;
        b[a[curr_num]] = 1;
        swap(a[1], a[curr_num]);
      } else {
        ans.push_back({curr_num_index, n});
        b[a[n]] = curr_num_index;
        b[a[curr_num_index]] = n;
        swap(a[curr_num_index], a[n]);
        ans.push_back({1, n});
        b[a[1]] = n;
        b[a[n]] = 1;
        swap(a[1], a[n]);
        ans.push_back({1, curr_num});
        b[a[1]] = curr_num;
        b[a[curr_num]] = 1;
        swap(a[1], a[curr_num]);
      }
    }
    curr_num = n / 2 - (curr - 1);
    curr_num_index = b[curr_num];
    if (curr_num_index != curr_num) {
      if (curr_num_index < n / 2) {
        ans.push_back({n, curr_num_index});
        b[a[n]] = curr_num_index;
        b[a[curr_num_index]] = n;
        swap(a[curr_num_index], a[n]);
        ans.push_back({n, curr_num});
        b[a[n]] = curr_num;
        b[a[curr_num]] = n;
        swap(a[n], a[curr_num]);
      } else {
        ans.push_back({curr_num_index, 1});
        b[a[1]] = curr_num_index;
        b[a[curr_num_index]] = 1;
        swap(a[curr_num_index], a[1]);
        ans.push_back({1, n});
        b[a[1]] = n;
        b[a[n]] = 1;
        swap(a[1], a[n]);
        ans.push_back({n, curr_num});
        b[a[n]] = curr_num;
        b[a[curr_num]] = n;
        swap(a[n], a[curr_num]);
      }
    }
  }
  cout << ans.size() << endl;
  for (int i = 0; i < ans.size(); i++) {
    cout << ans[i].first << " " << ans[i].second << endl;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cout.precision(50);
  solve();
}
