#!/usr/bin/ python3.8
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

N = int(readline())
A = tuple(map(int, readline().split()))


class BinaryIndexedTree():
    def __init__(self, seq):
        self.size = len(seq)
        self.depth = self.size.bit_length()
        self.build(seq)

    def build(self, seq):
        data = seq
        size = self.size
        for i, x in enumerate(data):
            j = i + (i & (-i))
            if j < size:
                data[j] += data[i]
        self.data = data

    def __repr__(self):
        return self.data.__repr__()

    def get_sum(self, i):
        data = self.data
        s = 0
        while i:
            s += data[i]
            i -= i & -i
        return s

    def add(self, i, x):
        data = self.data
        size = self.size
        while i < size:
            data[i] += x
            i += i & -i

    def find_kth_element(self, k):
        data = self.data
        size = self.size
        x, sx = 0, 0
        dx = 1 << (self.depth)
        for i in range(self.depth - 1, -1, -1):
            dx = (1 << i)
            if x + dx >= size:
                continue
            y = x + dx
            sy = sx + data[y]
            if sy < k:
                x, sx = y, sy
        return x + 1


def solve(A):
    x_to_i = {x: i for i, x in enumerate(sorted(set(A)))}
    num_to_ind = [[] for _ in range(len(x_to_i))]
    for i, x in enumerate(A, 1):
        num_to_ind[x_to_i[x]].append(i)
    ret = 0
    for t in range(2):
        bit = BinaryIndexedTree([0] * (N + 1))
        total_below = 0
        it = num_to_ind if t else reversed(num_to_ind)
        for ind in it:
            counts = [bit.get_sum(i) for i in ind]
            for x in counts:
                ret += x * (total_below - x)  # small, x, small
            n = len(ind)
            for i in range(1, n):
                ret -= (counts[i] - counts[i - 1]) * i * (n - i)  # x, small, x
            for i in ind:
                bit.add(i, 1)
            total_below += n
    return ret


answer = solve(A)
print(answer)