#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

typedef pair<int, int> PII;

const int N = 110;

int n, p[N];
PII a[N];
vector<PII> ans;

int main() {
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i) {
        scanf("%d", &a[i].first);
        a[i].second = i;
    }
    sort(a + 1, a + n + 1);
    for (int i = 1; i <= n; ++i) {
        a[i].first = i;
    }
    sort(a + 1, a + n + 1, [](PII p1, PII p2) { return p1.second < p2.second; });
    for (int i = 1; i <= n; ++i) {
        p[a[i].first] = i;
    }
    for (int i = 1; i <= n; ++i) {
        if (p[i] != i) {
            ans.push_back({ i, p[i] });
            p[a[i].first] = p[i];
            swap(a[i].first, a[p[i]].first);
            p[i] = i;
        }
    }
    printf("%d\n", ans.size());
    for (int i = 0; i < ans.size(); ++i) {
        printf("%d %d\n", ans[i].first, ans[i].second);
    }

    return 0;
}