package main

import (
	"fmt"
	"sort"
)

func solve() {
	ans := make([]int, 0, 10000)
	var n int
	fmt.Scan(&n)
	a := make([]int, n)
	for i := 0; i < n; i++ {
		fmt.Scan(&a[i])
	}
	for i := 0; i < n; i++ {
		for j := 1; j < n-i; j++ {
			if a[j] < a[j-1] {
				sort.IntSlice(a).Swap(j, j-1)
				ans = append(ans, j)
				ans = append(ans, j-1)
			}
			if allNotKadomatsu(a){
				i = n
				j = n
			}
		}
	}
	fmt.Println(len(ans) / 2)
	for i := 0; i < len(ans)/2; i++ {
		fmt.Println(ans[i*2], ans[i*2+1])
	}
	var dummy string
	fmt.Scan(&dummy)
}

func main() {
	solve()
}

func allNotKadomatsu(a []int) bool {
	l := len(a)
	for i := 0; i < l-2; i++ {
		if isKadomatsu(a[i], a[i+1], a[i+2]) {
			return false
		}
	}
	return true
}

func isKadomatsu(a, b, c int) bool {
	if (b > a && b > c) || (b < a && b < c) {
		return true
	}
	return false
}