#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
vector<pair <int, int > > ans;
int a[4000];
void ssort(int n)
{
	 int i,j,mi;
	    for (i=0;i<n-1;i++)
	    {
	        mi=i;
	        for (j=i+1;j<n;j++)
	          if (a[j]<a[mi])
	            mi=j;
	        swap(a[mi], a[i]);
	        if (mi!=i) ans.push_back({mi, i});
	    }
}
int main() {
	freopen("sorting.in", "r", stdin);
	freopen("sorting.out", "w", stdout);
	int n;
	cin>>n;
	for (int i=0;i<n;i++) {
		cin>>a[i];
	}
	ssort(n);
	cout<<ans.size()<<endl;
	for (auto to:ans) {
		cout<<to.first+1<<" "<<to.second+1<<endl;
	}
}