#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> static void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> static void amax(T &x, U y) { if(x < y) x = y; }

int main() {
	int N;
	while(~scanf("%d", &N)) {
		vector<pair<int,int>> A(N);
		for(int i = 0; i < N; ++ i) {
			int x;
			scanf("%d", &x);
			A[i] = make_pair(x, i);
		}
		vpii ans(N), swaps(N);
		rep(rev, 2) {
			if(rev == 0)
				sort(A.begin(), A.end());
			else
				reverse(A.begin(), A.end());
			for(int i = 0, j; i < N; i = j) {
				j = i + 1;
				for(; j < N && A[j].first == A[i].first; ++ j);
				reu(k, i, j) {
					int l = A[k].second;
					if(i <= l && l < j)
						swap(A[k], A[l]);
				}
			}
			swaps.clear();
			vector<bool> vis(N);
			rep(i, N) if(!vis[i]) {
				int j = i;
				while(!vis[j]) {
					vis[j] = true;
					int k = A[j].second;
					if(!vis[k])
						swaps.emplace_back(j, k);
					j = k;
				}
			}
			if(ans.size() > swaps.size())
				ans.swap(swaps);
		}
		printf("%d\n", (int)ans.size());
		for(int i = 0; i < (int)ans.size(); ++ i)
			printf("%d %d\n", ans[i].first, ans[i].second);
		fflush(stdout);
		//int dummy;
		//scanf("%d", &dummy);
		//assert(dummy == -1);
	}
	return 0;
}