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 i64 = long long;
using u64 = unsigned long long;
using u32 = unsigned;
int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int n;
    std::cin >> n;
    std::vector<int> c(n);
    for (int i = 0; i < n; i++) {
        std::cin >> c[i];
        c[i]--;
    }
    std::vector<int> a;
    std::vector<bool> vis(n);
    for (int i = 0; i < n; i++) {
        if (vis[i]) {
            continue;
        }
        int j = i;
        while (!vis[j]) {
            vis[j] = true;
            j = c[j];
        }
        a.push_back(i);
    }
    std::vector<std::pair<int, int>> ans;
    auto swap = [&](int i, int j) {
        std::swap(c[i], c[j]);
        ans.emplace_back(i, j);
    };
    auto solve = [&](int u, int v) {
        swap(u, v);
        while (true) {
            if (c[u] != v) {
                swap(u, c[u]);
            } else if (c[v] != u) {
                swap(v, c[v]);
            } else {
                swap(u, v);
                break;
            }
        }
    };
    for (int i = 0; i + 1 < int(a.size()); i += 2) {
        solve(a[i], a[i + 1]);
    }
    int u = a.back();
    if (c[u] != u) {
        if (a.size() == 1) {
            int v = c[u];
            swap(u, v);
            swap(c[u], v);
            while (true) {
                if (c[u] != v) {
                    swap(u, c[u]);
                } else if (c[v] != u) {
                    swap(v, c[v]);
                } else {
                    swap(u, v);
                    break;
                }
            }
        } else {
            int i = 0;
            while (c[i] != i) {
                i++;
            }
            solve(u, i);
        }
    }
    std::cout << ans.size() << "\n";
    for (auto [i, j] : ans) {
        std::cout << i + 1 << " " << j + 1 << "\n";
    }
    return 0;
}
