Problem: You are given a permutation p of integers from 1 to n, where n is an even number. 

Your goal is to sort the permutation. To do so, you can perform zero or more operations of the following type: 

  * take two indices i and j such that 2 ⋅ |i - j| ≥ n and swap p_i and p_j. 



There is no need to minimize the number of operations, however you should use no more than 5 ⋅ n operations. One can show that it is always possible to do that.

Input

The first line contains a single integer n (2 ≤ n ≤ 3 ⋅ 10^5, n is even) — the length of the permutation. 

The second line contains n distinct integers p_1, p_2, …, p_n (1 ≤ p_i ≤ n) — the given permutation.

Output

On the first line print m (0 ≤ m ≤ 5 ⋅ n) — the number of swaps to perform.

Each of the following m lines should contain integers a_i, b_i (1 ≤ a_i, b_i ≤ n, |a_i - b_i| ≥ n/2) — the indices that should be swapped in the corresponding swap.

Note that there is no need to minimize the number of operations. We can show that an answer always exists.

Examples

Input


2
2 1


Output


1
1 2

Input


4
3 4 1 2


Output


4
1 4
1 4
1 3
2 4


Input


6
2 5 3 1 4 6


Output


3
1 5
2 5
1 4

Note

In the first example, when one swap elements on positions 1 and 2, the array becomes sorted.

In the second example, pay attention that there is no need to minimize number of swaps.

In the third example, after swapping elements on positions 1 and 5 the array becomes: [4, 5, 3, 1, 2, 6]. After swapping elements on positions 2 and 5 the array becomes [4, 2, 3, 1, 5, 6] and finally after swapping elements on positions 1 and 4 the array becomes sorted: [1, 2, 3, 4, 5, 6].

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-ffloat-store")
#pragma GCC optimize("-fno-defer-pop")
long long int power(long long int a, long long int b, long long int m) {
  if (b == 0) return 1;
  if (b == 1) return a % m;
  long long int t = power(a, b / 2, m) % m;
  t = (t * t) % m;
  if (b & 1) t = ((t % m) * (a % m)) % m;
  return t;
}
long long int modInverse(long long int a, long long int m) {
  return power(a, m - 2, m);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int i, j, k, l, n;
  cin >> n;
  long long int ar[n + 1];
  map<long long int, long long int> mp;
  for (i = 1; i <= n; i++) {
    cin >> ar[i];
    mp[ar[i]] = i;
  }
  vector<pair<long long int, long long int> > vc;
  for (i = 1; i <= n; i++) {
    if (ar[i] != i) {
      k = mp[i];
      if (abs(k - i) >= (n / 2)) {
        mp[ar[i]] = k;
        vc.push_back({i, k});
        swap(ar[i], ar[k]);
      } else {
        if (k <= (n / 2)) {
          vc.push_back({k, n});
          mp[ar[n]] = k;
          swap(ar[k], ar[n]);
          if (abs(i - n) < (n / 2)) {
            vc.push_back({1, n});
            mp[ar[1]] = n;
            mp[ar[n]] = 1;
            swap(ar[1], ar[n]);
            vc.push_back({i, 1});
            mp[ar[i]] = 1;
            swap(ar[i], ar[1]);
          } else {
            vc.push_back({i, n});
            mp[ar[i]] = n;
            swap(ar[i], ar[n]);
          }
        } else {
          vc.push_back({k, 1});
          mp[ar[1]] = k;
          swap(ar[k], ar[1]);
          if (abs(1 - i) < (n / 2)) {
            vc.push_back({1, n});
            mp[ar[1]] = n;
            mp[ar[n]] = 1;
            swap(ar[1], ar[n]);
            vc.push_back({n, i});
            mp[ar[i]] = n;
            swap(ar[i], ar[n]);
          } else {
            vc.push_back({1, i});
            mp[ar[i]] = 1;
            swap(ar[i], ar[1]);
          }
        }
      }
    }
  }
  cout << vc.size() << "\n";
  for (i = 0; i < vc.size(); i++) {
    cout << vc[i].first << " " << vc[i].second << "\n";
  }
  return 0;
}