#include <bits/stdc++.h>
using namespace std;
const int M = 1e9 + 7;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char* x) { cerr << '\"' << x << '\"'; }
void __print(const string& x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V>& x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T>
void __print(const T& x) {
  int f = 0;
  cerr << '{';
  for (auto& i : x) cerr << (f++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cerr << ", ";
  _print(v...);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n;
  cin >> n;
  vector<pair<int, int>> ans;
  vector<int> A(n), pos(n);
  for (int i = 0; i < n; ++i) {
    cin >> A[i];
    --A[i];
    pos[A[i]] = i;
  }
  for (int i = 0; i < n; ++i) {
    if (i == pos[i]) {
      continue;
    }
    if (2 * (pos[i] - i) >= n) {
      swap(A[pos[i]], A[i]);
      ans.emplace_back(pos[i], A[i]);
      swap(pos[A[pos[i]]], pos[A[i]]);
      continue;
    }
    if ((i < n / 2) && (pos[i] < n / 2)) {
      swap(A[pos[i]], A[n - 1]);
      ans.emplace_back(pos[i], n - 1);
      swap(A[i], A[n - 1]);
      ans.emplace_back(i, n - 1);
      swap(A[pos[i]], A[n - 1]);
      ans.emplace_back(pos[i], n - 1);
      swap(pos[A[pos[i]]], pos[A[i]]);
    } else if ((i >= n / 2) && (pos[i] >= n / 2)) {
      swap(A[pos[i]], A[0]);
      ans.emplace_back(pos[i], 0);
      swap(A[i], A[0]);
      ans.emplace_back(i, 0);
      swap(A[pos[i]], A[0]);
      ans.emplace_back(pos[i], 0);
      swap(pos[A[pos[i]]], pos[A[i]]);
    } else {
      swap(A[i], A[n - 1]);
      ans.emplace_back(i, n - 1);
      swap(A[pos[i]], A[0]);
      ans.emplace_back(pos[i], 0);
      swap(A[0], A[n - 1]);
      ans.emplace_back(0, n - 1);
      swap(A[pos[i]], A[0]);
      ans.emplace_back(pos[i], 0);
      swap(A[i], A[n - 1]);
      ans.emplace_back(i, n - 1);
      swap(pos[A[pos[i]]], pos[A[i]]);
    }
  }
  cout << (int)ans.size() << "\n";
  for (auto p : ans) {
    cout << p.first + 1 << " " << p.second + 1 << "\n";
  }
  return 0;
}
