#include <bits/stdc++.h>

int n;
int xs[128];
std::vector<std::pair<int, int>> res;

int main() {
  scanf("%d", &n);
  for(int i = 0; i < n; ++i) {
    scanf("%d", &xs[i]);
  }

  for(int i = 0; i < n; ++i) {
    for(int j = 0; j < n - 1 - i; ++j) {
      if( xs[j] >= xs[j+1] ) {
        std::swap(xs[j], xs[j+1]);
        res.push_back(std::make_pair(j, j + 1));
      }
    }
  }
  printf("%d\n", (int)res.size());
  for(auto xy : res) {
    printf("%d %d\n", xy.first, xy.second);
  }

  int dummy;
  scanf("%d", &dummy);
  
  return 0;
}