#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

vector<pii> bubbleSort(vi &v){
    vector<pii> res;
    for(int i = 0; i < (int)v.size(); ++i){
        for(int j = i; j > 0 && v[j - 1] > v[j]; --j){
            swap(v[j - 1], v[j]);
            res.emplace_back(j - 1, j);
        }
    }
    return res;
}

int N, M;

int main(){
    scanf("%d", &N);
    vi a(N);
    rep(i, N)scanf("%d", &a[i]);

    auto ans = bubbleSort(a);
    printf("%d\n", sz(ans));
    each(x, ans){
        printf("%d %d\n", x.first, x.second);
    }
    fflush(stdout);
    int dummy;
    scanf("%d", &dummy);
}