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.
using namespace std;

#define visual

#ifdef visual
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#include <assert.h>
#include <functional>
#include <math.h>
#include <string>
#include <ctime>
#endif
#ifndef visual
#include <bits/stdc++.h>
#endif

typedef long long ll;


int main() {
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    
    int n;
    cin >> n;
    vector<int> v;
    for(int i=0; i<n; i++){
        int x;
        cin >> x;
        x--;
        v.push_back(x);
    }
    vector<vector<int> > cyc;
    vector<bool> seen(n, false);
    for(int i=0; i<n; i++){
        if(i == v[i]) continue;
        if(!seen[i]){
            vector<int> nw(1, i);
            seen[i] = true;
            int j = v[i];
            while(j != i){
                seen[j] = true;
                nw.push_back(j);
                j = v[j];
            }
             cyc.push_back(nw);
        }
       
    }
    vector<pair<int, int> > ans;
    while(cyc.size() >= 2){
        vector<int> a = cyc.back();
        cyc.pop_back();
        vector<int> b = cyc.back();
        cyc.pop_back();
        ans.push_back({a[0], b[0]});
        for(int i=1; i<a.size(); i++){
            ans.push_back({b[0], a[i]});
        }
        for(int i=1; i<b.size(); i++){
            ans.push_back({a[0], b[i]});
        }
        ans.push_back({a[0], b[0]});
    }
    if(cyc.size() == 1){
        vector<int> a = cyc[0];
        if(a.size() == 2){
            int z = 0;
            while(a[0] == z || a[1] == z) z++;
            ans.push_back({z, a[0]});
            ans.push_back({z, a[1]});
            ans.push_back({z, a[0]});
        }
        else{
            ans.push_back({a[0], a.back()});
            for(int i=1; i<a.size()-2; i++){
                ans.push_back({a[i], a.back()});
            }
            ans.push_back({a[0], a[a.size()-2]});
            ans.push_back({a[a.size()-2], a.back()});
            ans.push_back({a[0], a.back()});
        }

    }
    
    cout << ans.size() << endl;
    for(auto p : ans) cout << p.first+1 << " " << p.second+1 << endl;
}