#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <functional>
#include <map>
#include <iomanip>
#include <math.h> 
#include <stack>
#include <queue>
#include <bitset>
#include <cstdlib>
#include <tuple>
#include <cctype>
#include <ctype.h>
#include <set>

using namespace std;

int main() {
	int i, j, k;
	int n;
	vector<int>a, b;
	vector<vector<int>>reki(0, vector<int>(2));
	
	cin >> n;

	for (i = 0; i < n; i++) {
		int num;
		cin >> num;
		a.push_back(num);
		b.push_back(num);
	}

	int mainasu;
	cin >> mainasu;

	sort(b.begin(), b.end());


	int u, v;

	for (i = 0; i < b.size(); i++) {
		u = i;
		if (b[i] != a[i]) {
			for (j = i; j < a.size(); j++) {
				if (a[j] == b[i]) {
					v = j;
					int tmp = a[u];
					a[u] = a[v];
					a[v] = tmp;

					reki.push_back({u, v});
					break;
				}
			}
		}

	}

	cout << reki.size() << endl;

	for (i = 0; i < reki.size(); i++) {
		cout << reki[i][0] << " " << reki[i][1] << endl;
	}
	




	getchar();
	getchar();
	return 0;
}