#include <bits/stdc++.h>
using namespace std;
long long int bin(long long int a, long long int b) {
  if (b == 0) return 1;
  if (b & 1) return (a * bin((a * a) % 1000000007, b / 2)) % 1000000007;
  return (1 * bin((a * a) % 1000000007, b / 2)) % 1000000007;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int n;
  cin >> n;
  long long int arr[n + 1];
  long long int hash[n + 1];
  for (int i = 1; i <= n; i++) {
    cin >> arr[i];
    hash[arr[i]] = i;
  }
  vector<pair<long long int, long long int> > ans;
  for (long long int i = 1; i <= n; i++) {
    if (arr[i] != i) {
      if (abs(i - hash[i]) >= n / 2) {
        swap(arr[i], arr[hash[i]]);
        ans.push_back({i, hash[i]});
        hash[arr[hash[i]]] = hash[i];
        hash[i] = i;
      } else if (i - 1 >= n / 2 && hash[i] - 1 >= n / 2) {
        swap(arr[i], arr[hash[i]]);
        ans.push_back({1, i});
        ans.push_back({1, hash[i]});
        ans.push_back({1, i});
        hash[arr[hash[i]]] = hash[i];
        hash[i] = i;
      } else if (n - i >= n / 2 && n - hash[i] >= n / 2) {
        swap(arr[i], arr[hash[i]]);
        ans.push_back({n, i});
        ans.push_back({n, hash[i]});
        ans.push_back({n, i});
        hash[arr[hash[i]]] = hash[i];
        hash[i] = i;
      } else {
        swap(arr[i], arr[hash[i]]);
        ans.push_back({1, max(i, hash[i])});
        ans.push_back({n, min(i, hash[i])});
        ans.push_back({1, n});
        ans.push_back({1, max(i, hash[i])});
        ans.push_back({n, min(i, hash[i])});
        hash[arr[hash[i]]] = hash[i];
        hash[i] = i;
      }
    }
  }
  cout << ans.size() << endl;
  for (int i = 0; i < ans.size(); i++)
    cout << ans[i].first << " " << ans[i].second << endl;
}
