import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# md = 10**9+7
md = 998244353

def binary_search(l, r, minimize):
    if minimize: l -= 1
    else: r += 1
    while l+1 < r:
        m = (l+r)//2
        if ok(m) ^ minimize: l = m
        else: r = m
    if minimize: return r
    return l

def ok(m):
    return mx[m][0]>mn[-1][0]

n=II()
pp=LI()

ans=0
for _ in range(2):
    mx=[(-1,inf)]
    mn=[(-1,-inf)]
    for i,p in enumerate(pp):
        while mn[-1][-1]>p:mn.pop()
        if mx[-1][-1]>p:
            mi=binary_search(0,len(mx),True)
            ans+=len(mx)-mi
        while mx[-1][-1]<p:mx.pop()
        mn.append((i,p))
        mx.append((i,p))
        # print(i,p,ans)
        # print(mn)
        # print(mx)
    pp.reverse()

print(ans)