#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

int A[110];

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

    int N;
    std::cin >> N;

    for(int i=0;i<N;++i){
        std::cin >> A[i];
    }

    vector<P> queries;
    for(int i=0;i<N-1;++i){
        int mn = i;
        for(int j=i+1;j<N;++j){
            if(A[mn] > A[j]){
                mn = j;
            }
        }

        if(mn != i){
            queries.emplace_back(i, mn);
            swap(A[i], A[mn]);
        }
    }

    std::cout << queries.size() << std::endl;
    for(const auto &p : queries){
        int u, v;
        tie(u, v) = p;

        std::cout << u << " " << v << std::endl;
    }

    int _;
    std::cin >> _;
}