def solve(area):
    if len(area) <= 1:
        return 0
    count = 0
    max_ind = area.index(max(area))
    min_ind = max_ind
    for i in reversed(range(max_ind)):
        if area[min_ind] > area[i]:
            min_ind = i
            count += 1
    min_ind = max_ind
    for i in range(max_ind+1, len(area)):
        if area[min_ind] > area[i]:
            min_ind = i
            count += 1
    count += solve(area[0:max_ind])
    count += solve(area[max_ind+1:len(area)])
    return count

N = int(input())
data = (input().split())

print(solve(data))