#include "bits/stdc++.h"
typedef long long ll;

using namespace std;
#define finish(x) return cout << x, 0;
#define LOCAL freopen("in.txt", "r", stdin);

/*
template<typename... Args>
void print(Args... args) {
	((std::cout << args << " "), ...);
}
*/

int main(){
	freopen("sorting.in", "r", stdin);
	freopen("sorting.out", "w", stdout);

	int n;
	cin >> n;

	int arr[n];

	for(int i = 0; i < n; i++)
		cin >> arr[i];

	vector<pair<int, int>> ans;

	int i, j, min_idx;

	for (i = 0; i < n - 1; i++)
	{
		min_idx = i;

		for (j = i + 1; j < n; j++)
			if (arr[j] < arr[min_idx])
				min_idx = j;

		swap(arr[min_idx], arr[i]);
		ans.push_back({min_idx, i});
	}


	cout << ans.size() << endl;
	for(auto x : ans){
		cout << x.first + 1 << " " << x.second + 1 << endl;
	}
}