n = int(input())
P = list(map(int, input().split()))

sorted_values = sorted(P)
groups = []

if sorted_values:
    current_group = [sorted_values[0]]
    for i in range(1, len(sorted_values)):
        if sorted_values[i] == sorted_values[i-1] + 1:
            current_group.append(sorted_values[i])
        else:
            groups.append(current_group)
            current_group = [sorted_values[i]]
    groups.append(current_group)

total_inversions = 0

def count_inversions(arr):
    if len(arr) <= 1:
        return 0
    mid = len(arr) // 2
    left = arr[:mid]
    right = arr[mid:]
    inversions = count_inversions(left) + count_inversions(right)
    
    i = j = k = 0
    while i < len(left) and j < len(right):
        if left[i] <= right[j]:
            arr[k] = left[i]
            i += 1
        else:
            arr[k] = right[j]
            j += 1
            inversions += len(left) - i
        k += 1
    
    while i < len(left):
        arr[k] = left[i]
        i += 1
        k += 1
    while j < len(right):
        arr[k] = right[j]
        j += 1
        k += 1
    
    return inversions

for group in groups:
    min_v = group[0]
    max_v = group[-1]
    subarray = [P[i - 1] for i in range(min_v, max_v + 1)]
    total_inversions += count_inversions(subarray.copy())

print(total_inversions)