#include<iostream>
#include<string>
#include<algorithm>
#include<cctype>
#include<set>
#include<bitset>
#include<math.h>
#include<map>
#include<queue>
#include<iomanip>
using namespace std;
using ll = long long;

int main()
{
    int n, cnt = 0;
    cin >> n;
    vector<int> v(n);
    vector<vector<int>> ch;
    for (int i = 0; i < n; i++) cin >> v[i];
    for (int i = 0; i < n - 1; i++){
        for (int j = 0; j < n-i-1; j++){
            if (v[j] > v[j+1]){
                swap(v[j], v[j+1]);
                ch.push_back({j, j+1});
                cnt++;
            }
        }   
    }
    cout << cnt << endl;
    for (auto x : ch){
        for (auto y1 : x){
            cout << y1 << " ";
        }
        cout << endl;
    }
    //for (auto x : v){
    //    cout << x << " ";
    //}
    //cout << endl;
    cin >> cnt;
}