There are n coins labeled from 1 to n. Initially, coin c_i is on position i and is facing upwards ((c_1, c_2, ..., c_n) is a permutation of numbers from 1 to n). You can do some operations on these coins. 

In one operation, you can do the following:

  * Choose 2 distinct indices i and j.

  * Then, swap the coins on positions i and j.

  * Then, flip both coins on positions i and j. (If they are initially faced up, they will be faced down after the operation and vice versa)




Construct a sequence of at most n+1 operations such that after performing all these operations the coin i will be on position i at the end, facing up.

Note that you do not need to minimize the number of operations.

Input

The first line contains an integer n (3 ≤ n ≤ 2 ⋅ 10^5) — the number of coins.

The second line contains n integers c_1,c_2,...,c_n (1 ≤ c_i ≤ n, c_i ≠ c_j for i≠ j).

Output

In the first line, output an integer q (0 ≤ q ≤ n+1) — the number of operations you used.

In the following q lines, output two integers i and j (1 ≤ i, j ≤ n, i ≠ j) — the positions you chose for the current operation.

Examples

Input


3
2 1 3


Output


3
1 3
3 2
3 1


Input


5
1 2 3 4 5


Output


0

Note

Let coin i facing upwards be denoted as i and coin i facing downwards be denoted as -i.

The series of moves performed in the first sample changes the coins as such:

  * [~~~2,~~~1,~~~3] 
  * [-3,~~~1,-2] 
  * [-3,~~~2,-1] 
  * [~~~1,~~~2,~~~3] 



In the second sample, the coins are already in their correct positions so there is no need to swap.
#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(i, a) for(auto& i : a)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;


#ifdef LOCAL
#include "pretty_debug.h"
#else
#define debug(...) //ignore
#endif

int main() {
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  int n;
  cin >> n;
  vi p(n);
  rep(i,0,n) {
    cin>>p[i];
    --p[i];
  }

  vi flip(n);
  vector<pii> ans;
  auto swp = [&](int i, int j) {
    debug(i,j);
    assert(i != j);
    swap(p[i], p[j]);
    swap(flip[i], flip[j]);
    flip[i] ^= 1;
    flip[j] ^= 1;
    ans.emplace_back(i,j);
  };

  vi singletons;
  vector<vi> cyc;
  vi vis(n);
  rep(i,0,n) if(!vis[i]) {
    int x = i;
    vi c;
    do {
      vis[x] = 1;
      c.emplace_back(x);
      x = p[x];
    } while(x != i);
    if(sz(c) > 1) cyc.emplace_back(c);
    else singletons.emplace_back(i);
  }
  debug(cyc);
  debug(singletons);
  //TODO: sort cyc by size?
  while(sz(cyc) >= 2) {
    vi a = cyc.back(); cyc.pop_back();
    vi b = cyc.back(); cyc.pop_back();
    swp(a[0], b[0]);
    while(!flip[p[a[0]]]) swp(a[0], p[a[0]]);
    while(!flip[p[b[0]]]) swp(b[0], p[b[0]]);
    assert(a[0] == p[b[0]] && b[0] == p[a[0]] && flip[a[0]] && flip[b[0]]);
    swp(a[0],b[0]);
    for(int x : a) singletons.emplace_back(x);
    for(int y : b) singletons.emplace_back(y);
  }

  if(sz(cyc)) {
    vi c = cyc.back(); cyc.pop_back();
    if(sz(c) == 2) {
      int x = c[0], y = c[1], z = singletons[0];
      swp(x,z);
      swp(y,z);
      swp(x,z);
    }
    else {
      int x = c[0], y = c[1], z = c[2];
      swp(x,y);
      swp(y,z);
      while(!flip[p[x]]) swp(x, p[x]);
      while(!flip[p[y]]) swp(y, p[y]);
      assert(x == p[y] && y == p[x] && flip[x] && flip[y]);
      swp(x,y);
    }
  }

  cout << sz(ans) << endl;
  for(auto [a,b] : ans)
    cout << a+1 << " " << b+1 << "\n";

  assert(sz(ans) <= n+1);
  rep(i,0,n) assert(p[i] == i);
  rep(i,0,n) assert(!flip[i]);
}
