Q3

n = int(input())
arr = []
for i in range(n):
    arr.append(int(input()))

def bubbleSort(arr):
    n = len(arr)
    swaps = 0
    for i in range(n):
        for j in range(0, n-i-1):
            if arr[j] > arr[j+1]:
                arr[j], arr[j+1] = arr[j+1], arr[j]
                swaps += 1
    return swaps


swaps = bubbleSort(arr)

print(swaps+n)