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>

#define fi first
#define se second

const int N = 200200;

using namespace std;

int n;
int a[N];
int b[N];
int c[N];
bool used[N];
vector < pair < int, int > > res;

void make(int x, int y)
{
        b[x] ^= 1;
        b[y] ^= 1;
        swap(a[x], a[y]);
        swap(c[a[x]], c[a[y]]);
        res.push_back({a[x], a[y]});
}

int main()
{
        //freopen("input.txt", "r", stdin);
        //freopen("output.txt", "w", stdout);
        ios_base::sync_with_stdio(0);

        cin >> n;
        for(int i = 1; i <= n; i++){
                cin >> a[i];
                c[a[i]] = i;
        }

        for(int i = 1; i <= n; i++){
                swap(a[i], c[i]);
        }

        vector < vector < int > > C;
        for(int i = 1; i <= n; i++){
                if(used[i]){
                        continue;
                }
                C.push_back({i});
                int x = a[i];
                while(x != i){
                        C.back().push_back(x);
                        used[x] = true;
                        x = a[x];
                }
        }

        if(C.size() == 1){
                make(C.back()[0], C.back()[1]);
                make(C.back()[1], C.back()[n - 1]);
        } else if(C.size() % 2 == 0){
                for(int i = 0; i < C.size(); i += 2){
                        make(C[i][0], C[i + 1][0]);
                }
        } else{
                make(C[0][0], C[1][0]);
                make(C[1][0], C[2][0]);
                for(int i = 3; i < C.size(); i += 2){
                        make(C[i][0], C[i + 1][0]);
                }
        }

        for(int i = 1; i <= n; i++){
                used[i] = 0;
        }

        for(int i = 1; i <= n; i++){
                //cout << a[i] << " ";
                //assert(a[i] == i);
        }
        //cout << "\n";

        vector < int > g;
        for(int i = 1; i <= n; i++){
                if(a[i] == i || used[i]){
                        continue;
                }
                g.clear();
                g.push_back(i);
                int x = a[i];
                while(x != i){
                        used[x] = true;
                        g.push_back(x);
                        x = a[x];
                }

                int X = -1, Y = -1;
                for(int i = 0; i < g.size(); i++){
                        if(b[g[i]]){
                                if(X == -1){
                                        X = i;
                                } else{
                                        Y = i;
                                }
                        }
                        //cout << g[i] << " ";
                }
                //cout << X << " " << Y << "\n";

                for(int i = Y; i - 1 > X; i--){
                        make(g[i], g[i - 1]);
                }
                for(int i = X; i > 0; i--){
                        make(g[i], g[i - 1]);
                }

                if(Y + 1 < g.size()){
                        make(g[0], g[g.size() - 1]);
                        for(int i = g.size() - 2; i > Y; i--){
                                make(g[i], g[i + 1]);
                        }
                        make(g[Y + 1], g[X + 1]);
                } else{
                        make(g[0], g[X + 1]);
                }

        }
        for(int i = 1; i <= n; i++){
                //cout << a[i] << " ";
                assert(a[i] == i);
        }
        //cout << "\n";
        cout << res.size() << "\n";
        for(auto p: res){
                cout << p.fi << " " << p.se << "\n";
        }
}
