n = int(input())
a = list(map(int, input().split()))
dummy = input()  # Dummy input handling

original = a.copy()
swaps = []

# Perform selection sort in descending order to eliminate Kadomatsu sequences
for i in range(n - 1):
    max_idx = i
    for j in range(i + 1, n):
        if original[j] > original[max_idx]:
            max_idx = j
    if max_idx != i:
        swaps.append((i, max_idx))
        original[i], original[max_idx] = original[max_idx], original[i]

# Output the result
print(len(swaps))
for u, v in swaps:
    print(u, v)