#include <bits/stdc++.h>

#define REP(i, x, n) for (int i = x; i < (int)(n); i++)
#define rep(i, n) REP (i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x.size())
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define uniq(x) x.erase(unique(x.begin(), x.end()), x.end())
#define F first
#define S second
#define mp make_pair
#define eb emplace_back

using namespace std;

typedef long long ll;

const int INF = 1 << 29;

int main() {
    int n;
    cin >> n;
    vector<int> a(n);
    rep (i, n) cin >> a[i];

    int cnt = 0;
    vector<pair<int, int>> p;
    rep (i, n) {
        int minv = a[i];
        int idx = i;
        REP (j, i + 1, n) {
            if (minv > a[j]) {
                minv = a[j];
                idx = j;
            }
        }
        if (idx != i) {
            cnt++;
            p.eb(mp(i, idx));
            swap(a[i], a[idx]);
        }
    }

    cout << cnt << endl;
    rep (i, sz(p)) {
        cout << p[i].F << ' ' << p[i].S << endl;
    }

    int tmp;
    cin >> tmp;
}