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 namespace std;
const int N=200005;
int n,m,a[N],v[N];
vector<int>c[N],a1,a2;
void add(int x,int y)
{
	a1.push_back(x);
	a2.push_back(y);
}
int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
		scanf("%d",&a[i]);
	for(int i=1;i<=n;i++)
	{
		if(i!=a[i]&&!v[i])
		{
			m++;
			c[m].push_back(i),v[i]=1;
			for(int x=a[i];x!=i;x=a[x])
				c[m].push_back(x),v[x]=1;
		}
	}
	while(m>=2)
	{
		auto &x=c[m],&y=c[m-1];
		add(x[0],y[0]);
		for(int i=1;i<x.size();i++)
			add(y[0],x[i]);
		for(int i=1;i<y.size();i++)
			add(x[0],y[i]);
		add(x[0],y[0]);
		m-=2;
	}
	if(m)
	{
		auto &x=c[1];
		if(x.size()==2)
		{
			int p=0;
			if(!p&&x[0]!=1&&x[1]!=1) p=1;
			if(!p&&x[0]!=2&&x[1]!=2) p=2;
			if(!p&&x[0]!=3&&x[1]!=3) p=3;
			add(x[0],p),add(x[1],p),add(x[0],p);
		}
		else
		{
			add(x[0],x[1]),add(x[1],x[2]);
			for(int i=3;i<x.size();i++)
				add(x[1],x[i]);
			add(x[0],x[2]),add(x[0],x[1]);
		}
	}
	printf("%d\n",a1.size());
	for(int i=0;i<a1.size();i++)
		printf("%d %d\n",a1[i],a2[i]);
	return 0;
}
	  	  			 	   	 			  	 					 	