n = int(input())
arr = list(map(int, input().split()))
dummy = input()  # read the dummy input

# Sort the array in non-increasing order to avoid kadomatsu sequences
target = sorted(arr, reverse=True)
current = arr.copy()
swaps = []

for i in range(n):
    # Find the maximum element's index from i to end
    max_idx = i
    for j in range(i, n):
        if current[j] > current[max_idx]:
            max_idx = j
    if max_idx != i:
        swaps.append((i, max_idx))
        current[i], current[max_idx] = current[max_idx], current[i]

print(len(swaps))
for u, v in swaps:
    print(u, v)