#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <deque>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <ctime>
#include <iterator>
#include <bitset>
#include <numeric>
#include <list>
#include <iomanip>
#include <cassert>
#include <array>
#include <tuple>
#include <initializer_list>
#include <unordered_set>
#include <unordered_map>
#include <forward_list>
using namespace std;
using ll = long long;
#define rep(i,k) for (int i = 0; i < (int)(k); i++)
#define all(c) begin(c), end(c)

int main() {
    int n;
    while (cin >> n) {
        vector<int> a(n);
        for (size_t i = 0; i < n; i++) {
            cin >> a[i];
        }
        int t;
        cin >> t;
        vector<pair<int, int>> ans;
        for (size_t i = 0; i < n; i++) {
            int x = min_element(a.begin() + i, a.end()) - a.begin();
            if (x != i) {
                ans.emplace_back(x, i);
                swap(a[i], a[x]);
            }
        }
        cout << ans.size() << endl;
        for (size_t i = 0; i < ans.size(); i++) {
            cout << ans[i].first << ' ' << ans[i].second << endl;
        }
        cout << flush;
    }
}