import sys

def solve():
    N = int(input())
    A = [int(i) for i in input().split()]
    op = []

    for i in range(N - 1):
        min_i = i

        for j in range(i + 1, N):
            if A[j] < A[min_i]:
                min_i = j

        if i != min_i:
            op.append((i, min_i))
            A[i], A[min_i] = A[min_i], A[i]

    print(len(op), flush=True)
    for i, j in op:
        print(i, j, flush=True)

    input() # Dummy

if __name__ == '__main__':
    solve()