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

using namespace std;

typedef pair<int, int> PII;

const int N = 110;

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

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

    scanf("%d", &n);
    for (int i = 1; i <= n; ++i) {
        scanf("%d", &a[i]);
    }

    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
            if (a[j - 1] > a[j]) {
                swap(a[j - 1], a[j]);
                ans.push_back({ j - 1, j });
            }
        }
    }

    printf("%d\n", ans.size());
    for (int i = 0; i < ans.size(); ++i) {
        printf("%d %d\n", ans[i].first - 1, ans[i].second - 1);
    }

    return 0;
}