def solve(A):
    while len(A) >= 2 and A[-1] > A[-2]:
        A.pop()
    A.reverse()
    while len(A) >= 2 and A[-1] > A[-2]:
        A.pop()

    if len(A) < 3:
        return 0

    m = [0]
    for i in range(1, len(A) - 1):
        if A[i-1] < A[i] and A[i] > A[i + 1]:
            m.append(i)
        if A[i-1] > A[i] and A[i] < A[i + 1]:
            m.append(i)
    m.append(len(A) - 1)

    assert(len(m) % 2 == 1)
    ans = 0
    L = 0
    for i in range(len(m) - 1):
        if i % 2 == 0:
            L += abs(m[i] - m[i+1])
        else:
            ans += L * abs(m[i] - m[i+1])
    return ans


N = int(input())
A = list(map(int, input().split()))

ans = 0
L = 0
for i in range(N - 1):
    if A[i] == A[i + 1]:
        ans += solve(A[L:i + 1])
        L = i + 1
ans += solve(A[L:N])
print(ans)