class Compression:
    def __init__(self, iterable):
        self.vs = sorted(set(iterable))
        self.v2i = {}
        for i, val in enumerate(self.vs):
            self.v2i[val] = i

    def __len__(self):
        return len(self.vs)

    def index(self, val):
        """val のインデックスを返す"""
        return self.v2i[val]

    def value(self, index):
        """インデックスに対応する値を返す"""
        return self.vs[index]

    def map(self, iterable):
        return [self.index(x) for x in iterable]


class FenwickTree:
    def __init__(self, n: int):
        self.data = [0] * (n+10)
        self.n = (n+10)

    def get(self, p: int):
        return self.rangesum(p, p)

    def add(self, p: int, x: int):
        assert 0 <= p < self.n
        p += 1
        while p < len(self.data):
            self.data[p] += x
            p += p & -p

    def sum(self, p: int) -> int:
        """区間 [0, p] の和"""
        assert 0 <= p < self.n
        p += 1
        s = 0
        while p > 0:
            s += self.data[p]
            p -= p & -p
        return s

    def rangesum(self, l: int, r: int) -> int:
        """区間 [l, r] の和"""
        assert 0 <= l <= r < self.n
        s = self.sum(r)
        if l > 0:
            s -= self.sum(l-1)
        return s

INF = 1 << 60
N = int(input())
A = list(map(int, input().split()))

comp = Compression(A + [-INF, INF])


# 真ん中を最小値として固定する
def calc1():
    sz = len(comp)
    lft = FenwickTree(sz)
    rft = FenwickTree(sz)

    xs = [comp.index(a) for a in A]
    for x in xs:
        rft.add(x, 1)

    dup = FenwickTree(sz)
    res = 0
    for x in xs:  # 真ん中を x で固定
        rft.add(x, -1)

        # 重複の更新
        old = dup.get(x)
        lx = lft.get(x)
        rx = rft.get(x)
        dup.add(x, -old + lx * rx)

        l = lft.rangesum(x+1, sz)
        r = rft.rangesum(x+1, sz)
        res += l * r  # 重複あり
        res -= dup.rangesum(x+1, sz)  # 重複分を削除

        lft.add(x, 1)
        dup.add(x, rft.get(x))

    return res


# 真ん中の最大値として固定する
def calc2():
    sz = len(comp)
    lft = FenwickTree(sz)
    rft = FenwickTree(sz)

    xs = [comp.index(a) for a in A]
    for x in xs:
        rft.add(x, 1)

    dup = FenwickTree(sz)
    res = 0
    for x in xs:  # 真ん中を x で固定
        rft.add(x, -1)

        # 重複の更新
        old = dup.get(x)
        lx = lft.get(x)
        rx = rft.get(x)
        dup.add(x, -old + lx * rx)

        l = lft.rangesum(0, x-1)
        r = rft.rangesum(0, x-1)
        res += l * r  # 重複あり
        res -= dup.rangesum(0, x-1)  # 重複分を削除

        lft.add(x, 1)
        dup.add(x, rft.get(x))

    return res


ans = calc1() + calc2()
print(ans)