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;
#define fi first
#define se second
#define fill0(a) memset(a,0,sizeof(a))
#define fill1(a) memset(a,-1,sizeof(a))
#define fillbig(a) memset(a,63,sizeof(a))
#define pb push_back
#define ppb pop_back
#define mp make_pair
template<typename T1,typename T2> void chkmin(T1 &x,T2 y){if(x>y) x=y;}
template<typename T1,typename T2> void chkmax(T1 &x,T2 y){if(x<y) x=y;}
typedef pair<int,int> pii;
typedef long long ll;
typedef unsigned int u32;
typedef unsigned long long u64;
namespace fastio{
	#define FILE_SIZE 1<<23
	char rbuf[FILE_SIZE],*p1=rbuf,*p2=rbuf,wbuf[FILE_SIZE],*p3=wbuf;
	inline char getc(){return p1==p2&&(p2=(p1=rbuf)+fread(rbuf,1,FILE_SIZE,stdin),p1==p2)?-1:*p1++;}
	inline void putc(char x){(*p3++=x);}
	template<typename T> void read(T &x){
		x=0;char c=getchar();T neg=0;
		while(!isdigit(c)) neg|=!(c^'-'),c=getchar();
		while(isdigit(c)) x=(x<<3)+(x<<1)+(c^48),c=getchar();
		if(neg) x=(~x)+1;
	}
	template<typename T> void recursive_print(T x){if(!x) return;recursive_print(x/10);putc(x%10^48);}
	template<typename T> void print(T x){if(!x) putc('0');if(x<0) putc('-'),x=~x+1;recursive_print(x);}
	void print_final(){fwrite(wbuf,1,p3-wbuf,stdout);}
}
const int MAXN=2e5;
int n,p[MAXN+5],pth_n;
bool vis[MAXN+5];
vector<int> pth[MAXN+5];
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++) scanf("%d",&p[i]);
	for(int i=1;i<=n;i++) if(!vis[i]&&p[i]!=i){
		int cur=p[i];pth[++pth_n].pb(i);vis[i]=1;
		while(cur!=i) pth[pth_n].pb(cur),vis[cur]=1,cur=p[cur];
	} vector<pii> ans;//printf("%d\n",pth_n);
	for(int i=1;i+1<=pth_n;i+=2){
		ans.pb(mp(pth[i][0],pth[i+1][0]));
		for(int j=1;j<pth[i].size();j++) ans.pb(mp(pth[i][j],pth[i+1][0]));
		for(int j=1;j<pth[i+1].size();j++) ans.pb(mp(pth[i+1][j],pth[i][0]));
		ans.pb(mp(pth[i][0],pth[i+1][0]));
	}
	if(pth_n&1){
		if(pth[pth_n].size()==2){
			for(int i=1;i<=n;i++){
				if((i^pth[pth_n][0])&&(i^pth[pth_n][1])){
					ans.pb(mp(i,pth[pth_n][0]));
					ans.pb(mp(i,pth[pth_n][1]));
					ans.pb(mp(i,pth[pth_n][0]));
					break;
				}
			}
		} else {
			for(int i=1;i+1<pth[pth_n].size();i++)
				ans.pb(mp(pth[pth_n][0],pth[pth_n][i]));
			ans.pb(mp(pth[pth_n][1],pth[pth_n].back()));
			ans.pb(mp(pth[pth_n][0],pth[pth_n].back()));
			ans.pb(mp(pth[pth_n][0],pth[pth_n][1]));
		}
	} printf("%d\n",ans.size());
	for(int i=0;i<ans.size();i++) printf("%d %d\n",ans[i].fi,ans[i].se);
	return 0;
}