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

void solve() {
    int n;
    std::cin >> n;

    std::vector<int> xs(n);
    for (auto& x : xs) std::cin >> x;

    std::vector<std::pair<int, int>> ans;
    while (!xs.empty()) {
        int i = std::max_element(xs.begin(), xs.end()) - xs.begin();
        int j = (int)xs.size() - 1;

        if (xs[i] != xs[j]) ans.emplace_back(i, j);
        std::swap(xs[i], xs[j]);
        xs.pop_back();
    }

    std::cout << ans.size() << std::endl;
    for (auto p : ans) {
        std::cout << p.first << " " << p.second << std::endl;
    }

    {
        int tmp;
        std::cin >> tmp;
    }
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}