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;

using ll = long long;
const int inf = 1e9+10;
const ll inf_ll = 1e18+10;
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define cmax(x, y) (x = max(x, y))
#define cmin(x, y) (x = min(x, y))

#ifndef LOCAL
#define debug(...)
#else
#include "../../debug.cpp"
#endif

const int N = 2e5+5;
int a[N], h[N], v[N], s[N];
vector<array<int, 2>> ans;

void op(int i, int j) {
    ans.pb({i+1, j+1});
    swap(a[i], a[j]);
    if (h[i] == h[j]) h[i] ^= 1, h[j] ^= 1;
}

void fixcycle(int i) {
    if (i != a[i] && i == a[a[i]]) op(i, a[i]);
    if (i == a[i]) return;
    while (!h[i] || h[a[i]]) i = a[i];
    while (i != a[i]) op(i, a[i]);
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int n; cin >> n;
    for (int i = 0; i < n; i++)
        cin >> a[i], a[i]--;
    vector<int> c;
    int p = -1;
    for (int i = 0; i < n; i++)
        if (!v[i]) {
            c.pb(i);
            for (int j = i; !v[j]; j = a[j])
                v[j] = 1, s[i]++;
            if (s[i] == 1) c.pop_back(), p = i;
        }
    while (c.size() > 1) {
        int x = c.back(); c.pop_back();
        int y = c.back(); c.pop_back();
        p = x;
        op(a[x], a[y]), op(x, y);
        fixcycle(x);
        fixcycle(y);
    }
    if (c.size() == 1) {
        int x = c[0];
        int y = a[x], z = a[a[x]];
        if (s[c[0]] == 2) {
            op(x, p), op(y, p), op(x, p);
        } else {
            op(x, z), op(x, y);
            fixcycle(x);
        }
    }
    cout << ans.size() << "\n";
    for (auto& [i, j] : ans)
        cout << i << " " << j << "\n";
    debug(vector(a, a+n));
    debug(vector(h, h+n));
}