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 <algorithm>
#include <chrono>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <cassert>
#include <assert.h>

//#pragma GCC optimize("O3")

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

const ll MOD = 1000000007;
const ld EPS = 1e-11;
const ll INFL = 1e18;
const int INF = 1e9 + 7;
const ld PI = acos(-1);
const ld E = exp(1);

mt19937 rnd((unsigned)chrono::steady_clock::now().time_since_epoch().count());

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int n;
    cin >> n;
    vector<int> c(n);
    for (int i = 0; i < n; ++i) {
        cin >> c[i];
        --c[i];
    }

    vector<bool> inc(n, false);
    vector<vector<int>> cyc;
    for (int i = 0; i < n; ++i) {
        if (c[i] == i || inc[i]) {
            continue;
        }
        cyc.push_back({ i });
        while (c[cyc.back().back()] != cyc.back()[0]) {
            inc[c[cyc.back().back()]] = true;
            cyc.back().push_back(c[cyc.back().back()]);
        }
    }

    vector<int> ansl, ansr;
    while (cyc.size() > 1) {
        vector<int> cl = cyc.back();
        cyc.pop_back();
        vector<int> cr = cyc.back();
        cyc.pop_back();
        ansl.push_back(cl[0]);
        ansr.push_back(cr[0]);
        for (int i = 1; i < cl.size(); ++i) {
            ansl.push_back(cl[i]);
            ansr.push_back(cr[0]);
        }
        for (int i = 1; i < cr.size(); ++i) {
            ansl.push_back(cr[i]);
            ansr.push_back(cl[0]);
        }
        ansl.push_back(cl[0]);
        ansr.push_back(cr[0]);
    }

    if (cyc.size() == 0) {
        cout << ansl.size() << "\n";
        for (int i = 0; i < ansl.size(); ++i) {
            cout << ansl[i] + 1 << " " << ansr[i] + 1 << "\n";
            swap(c[ansl[i]], c[ansr[i]]);
            c[ansl[i]] *= -1;
            c[ansr[i]] *= -1;
            /*for (int j = 0; j < n; ++j) {
                cout << c[j] << " ";
            }
            cout << "\n";*/
        }

        return 0;
    }

    int nic = 0;
    if (cyc[0].size() == 2) {
        while (nic == cyc[0][0] || nic == cyc[0][1]) {
            ++nic;
        }
        ansl.push_back(cyc[0][0]);
        ansr.push_back(nic);
        ansl.push_back(cyc[0][1]);
        ansr.push_back(nic);
        ansl.push_back(cyc[0][0]);
        ansr.push_back(nic);
    }
    else {
        int plast = cyc[0][cyc[0].size() - 2];
        int plass = cyc[0][cyc[0].size() - 3];
        ansl.push_back(plast);
        ansr.push_back(cyc[0].back());
        for (int i = 0; i < cyc[0].size() - 3; ++i) {
            ansl.push_back(cyc[0][i]);
            ansr.push_back(plast);
        }
        ansl.push_back(plass);
        ansr.push_back(cyc[0].back());
        ansl.push_back(plass);
        ansr.push_back(plast);
        ansl.push_back(plast);
        ansr.push_back(cyc[0].back());
    }

    cout << ansl.size() << "\n";
    for (int i = 0; i < ansl.size(); ++i) {
        cout << ansl[i] + 1 << " " << ansr[i] + 1 << "\n";
        swap(c[ansl[i]], c[ansr[i]]);
        c[ansl[i]] *= -1;
        c[ansr[i]] *= -1;
        /*for (int j = 0; j < n; ++j) {
            cout << c[j] << " ";
        }
        cout << "\n";*/
    }

    return 0;
}