import numpy as np


def solve_left(area, selected_ind):
    if area.shape[0] <= 1:
        return 0
    max_ind = np.argmax(area)
    min_ind = max_ind
    selected_ind[max_ind: selected_ind.shape[0]] = 0
    for i in range(max_ind+1, area.shape[0]):
        if area[min_ind] > area[i]:
            min_ind = i
            selected_ind[i] = 1
    count = np.sum(selected_ind)
    count += solve_left(area[0:max_ind], selected_ind[0:max_ind])
    count += solve_right(area[max_ind+1:area.shape[0]], selected_ind[max_ind+1:selected_ind.shape[0]])
    return count


def solve_right(area, selected_ind):
    if area.shape[0] <= 1:
        return 0
    max_ind = np.argmax(area)
    min_ind = max_ind
    selected_ind[0: max_ind + 1] = 0
    for i in reversed(range(max_ind)):
        if area[min_ind] > area[i]:
            min_ind = i
            selected_ind[i] = 1
    count = np.sum(selected_ind)
    count += solve_left(area[0:max_ind], selected_ind[0:max_ind])
    count += solve_right(area[max_ind+1:area.shape[0]], selected_ind[max_ind+1:selected_ind.shape[0]])
    return count


def solve(area):
    selected_ind = area*0
    max_ind = np.argmax(area)
    min_ind = max_ind
    for i in reversed(range(max_ind + 0)):
        if area[min_ind] > area[i]:
            min_ind = i
            selected_ind[i] = 1
    min_ind = max_ind
    for i in range(max_ind+1, area.shape[0]):
        if area[min_ind] > area[i]:
            min_ind = i
            selected_ind[i] = 1
    count = np.sum(selected_ind)
    count += solve_left(area[0:max_ind], selected_ind[0:max_ind])
    count += solve_right(area[max_ind+1:area.shape[0]], selected_ind[max_ind+1:selected_ind.shape[0]])
    return count

N = int(input())
input_np = np.array(input().split()).astype(np.int32)

print(solve(input_np))