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>

int main() {
	using namespace std;
	ios_base::sync_with_stdio(false), cin.tie(nullptr);

	int N; cin >> N;
	vector<int> A(N); for (auto& a : A) { cin >> a; a--; }
	vector<array<int, 2>> ans; ans.reserve(N+1);

	auto do_swap = [&](int x, int y) {
		ans.push_back({x, y});
		A[x] = ~A[x];
		A[y] = ~A[y];
		std::swap(A[x], A[y]);
	};

	vector<int> cycle_starts; cycle_starts.reserve(N);
	vector<bool> vis(N, false);
	for (int i = 0; i < N; i++) {
		if (A[i] == i) continue;
		if (vis[i]) continue;
		cycle_starts.push_back(i);
		for (int cur = i; !vis[cur]; cur = A[cur]) {
			vis[cur] = true;
		}
	}

	while (int(cycle_starts.size()) >= 2) {
		int X = cycle_starts.back(); cycle_starts.pop_back();
		int Y = cycle_starts.back(); cycle_starts.pop_back();
		do_swap(X, Y);
		while (~A[X] != Y) {
			do_swap(X, ~A[X]);
		}
		while (~A[Y] != X) {
			do_swap(Y, ~A[Y]);
		}
		do_swap(X, Y);
	}

	if (!cycle_starts.empty()) {
		int X = cycle_starts.back();
		if (A[A[X]] == X) {
			// we need a 3rd node
			int Y = 0;
			while (Y == X || Y == A[X]) Y++;
			do_swap(X, Y);
			while (~A[X] != Y) {
				do_swap(X, ~A[X]);
			}
			while (~A[Y] != X) {
				do_swap(Y, ~A[Y]);
			}
			do_swap(X, Y);
		} else {
			int Y = A[X];
			int Z = A[Y];
			do_swap(Y, Z);
			do_swap(X, Z);
			while (~A[Y] != Z) {
				do_swap(Y, ~A[Y]);
			}
			while (~A[Z] != Y) {
				do_swap(Z, ~A[Z]);
			}
			do_swap(Y, Z);
		}
	}

	for (int i = 0; i < N; i++) {
		assert(A[i] == i);
	}

	cout << ans.size() << '\n';
	for (auto [x, y] : ans) {
		cout << x+1 << ' ' << y+1 << '\n';
	}

	return 0;
}
