#line 1 "No_121_\u50be\u5411\u3068\u5bfe\u7b56_\u9580\u677e\u5217_\u305d\u306e.cpp"
#define YRSD
#line 2 "YRS/all.hpp"

#line 2 "YRS/aa/head.hpp"

#include <iostream>
#include <algorithm>

#include <array>
#include <bitset>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>

#include <bit>
#include <chrono>
#include <functional>
#include <iomanip>
#include <utility>
#include <type_traits>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstring>
#include <ctime>
#include <limits>
#include <ranges>
#include <concepts>

#define TE template <typename T>
#define TES template <typename T, typename ...S>
#define Z auto
#define ep emplace_back
#define eb emplace
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()

#define OV4(a, b, c, d, e, ...) e
#define FOR1(a) for (int _ = 0; _ < (a); ++_)
#define FOR2(i, a) for (int i = 0; i < (a); ++i)
#define FOR3(i, a, b) for (int i = (a); i < (b); ++i)
#define FOR4(i, a, b, c) for (int i = (a); i < (b); i += (c))
#define FOR(...) OV4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FOR1_R(a) for (int _ = (a) - 1; _ >= 0; --_)
#define FOR2_R(i, a) for (int i = (a) - 1; i >= 0; --i)
#define FOR3_R(i, a, b) for (int i = (b) - 1; i >= (a); --i)
#define FOR4_R(i, a, b, c) for (int i = (b) - 1; i >= (a); i -= (c))
#define FOR_R(...) OV4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)
#define FOR_subset(t, s) for (int t = (s); t > -1; t = (t == 0 ? -1 : (t - 1) & s))

#define sort ranges::sort

using namespace std;

TE using vc = vector<T>;
TE using vvc = vc<vc<T>>;
TE using T1 = tuple<T>;
TE using T2 = tuple<T, T>;
TE using T3 = tuple<T, T, T>;
TE using T4 = tuple<T, T, T, T>;
TE using max_heap = priority_queue<T>;
TE using min_heap = priority_queue<T, vc<T>, greater<T>>;
using u8 = unsigned char; using uint = unsigned int; using ll = long long;      using ull = unsigned long long;
using ld = long double;   using i128 = __int128;     using u128 = __uint128_t;  using f128 = __float128;
using u16 = uint16_t;
using PII = pair<int, int>;   using PLL = pair<ll, ll>;

#ifdef YRSD
constexpr bool dbg = 1;
#else
constexpr bool dbg = 0;
#endif
#line 2 "YRS/IO/IO.hpp"

istream &operator>>(istream &I, i128 &x) {
  static string s;
  I >> s;
  int f = s[0] == '-';
  x = 0;
  const int N = (int)s.size();
  FOR(i, f, N) x = x * 10 + s[i] - '0';
  if (f) x = -x;
  return I;
}
ostream &operator<<(ostream &O, i128 x) {
  static string s;
  s.clear();
  bool f = x < 0;
  if (f) x = -x;
  while (x) s += '0' + x % 10, x /= 10;
  if (s.empty()) s += '0';
  if (f) s += '-';
  reverse(all(s));
  return O << s;
}
istream &operator>>(istream &I, f128 &x) {
  static string s;
  I >> s, x = stold(s);
  return I;
}
ostream &operator<<(ostream &O, const f128 x) { return O << ld(x); }
template <typename... S>
istream &operator>>(istream &I, tuple<S...> &t) {
  return apply([&I](Z &...s) { ((I >> s), ...); }, t), I;
}
template <typename T, typename U>
istream &operator>>(istream &I, pair<T, U> &x) {
  return I >> x.fi >> x.se;
}
template <typename T, typename U>
ostream &operator<<(ostream &O, const pair<T, U> &x) {
  return O << x.fi << ' ' << x.se;
}
TE requires requires(T &c) { begin(c); end(c); } and 
                          (not is_same_v<decay_t<T>, string>)
istream &operator>>(istream &I, T &c) {
  for (Z &e : c) I >> e;
  return I;
}
TE requires requires(const T &c) { begin(c); end(c); } and 
  (not is_same_v<decay_t<T>, const char*>) and 
  (not is_same_v<decay_t<T>, string>) and 
  (not is_array_v<remove_reference_t<T>> or 
   not is_same_v<remove_extent_t<remove_reference_t<T>>, char>)
ostream &operator<<(ostream &O, const T &a) {
  if (a.empty()) return O;
  Z i = a.begin();
  O << *i++;
  for (; i != a.end(); ++i) O << ' ' << *i;
  return O;
}
void IN() {}
TE void IN(T &x, Z &...s) { cin >> x, IN(s...); }
void print() { cout << '\n'; }
TES void print(T &&x, S &&...y) {
  cout << x;
  if constexpr (sizeof...(S)) cout << ' ';
  print(forward<S>(y)...);
}
void put() { cout << ' '; }
TES void put(T &&x, S &&...y) {
  cout << x;
  if constexpr (sizeof...(S)) cout << ' ';
  put(forward<S>(y)...);
}

#define INT(...)  int    __VA_ARGS__; IN(__VA_ARGS__)
#define UINT(...) uint   __VA_ARGS__; IN(__VA_ARGS__)
#define LL(...)   ll     __VA_ARGS__; IN(__VA_ARGS__)
#define ULL(...)  ull    __VA_ARGS__; IN(__VA_ARGS__)
#define I128(...) i128   __VA_ARGS__; IN(__VA_ARGS__)
#define STR(...)  string __VA_ARGS__; IN(__VA_ARGS__)
#define CH(...)   char   __VA_ARGS__; IN(__VA_ARGS__)
#define REAL(...) re     __VA_ARGS__; IN(__VA_ARGS__)
#define VEC(T, a, n) vc<T> a(n); IN(a)

void YES(bool o = 1) { print(o ? "YES" : "NO"); }
void Yes(bool o = 1) { print(o ? "Yes" : "No"); }
void yes(bool o = 1) { print(o ? "yes" : "no"); }
void NO(bool o = 1) { YES(not o); }
void No(bool o = 1) { Yes(not o); }
void no(bool o = 1) { yes(not o); }
void ALICE(bool o = 1) { print(o ? "ALICE" : "BOB"); }
void Alice(bool o = 1) { print(o ? "Alice" : "Bob"); }
void alice(bool o = 1) { print(o ? "alice" : "bob"); }
void BOB(bool o = 1) { ALICE(not o); }
void Bob(bool o = 1) { Alice(not o); }
void bob(bool o = 1) { alice(not o); }
void POSSIBLE(bool o = 1) { print(o ? "POSSIBLE" : "IMPOSSIBLE"); }
void Possible(bool o = 1) { print(o ? "Possible" : "Impossible"); }
void possible(bool o = 1) { print(o ? "possible" : "impossible"); }
void IMPOSSIBLE(bool o = 1) { POSSIBLE(not o); }
void Impossible(bool o = 1) { Possible(not o); }
void impossible(bool o = 1) { possible(not o); }
void TAK(bool o = 1) { print(o ? "TAK" : "NIE"); }
void NIE(bool o = 1) { TAK(not o); }
#line 5 "YRS/all.hpp"

#if (__cplusplus >= 202002L)
#include <numbers>
constexpr ld pi = numbers::pi;
#endif
TE constexpr T inf = numeric_limits<T>::max();
template <> constexpr i128 inf<i128> = i128(inf<ll>) * 2'000'000'000'000'000'000;
template <typename T, typename U>
constexpr pair<T, U> inf<pair<T, U>> = {inf<T>, inf<U>};

TE constexpr static inline int pc(T x) { return popcount(make_unsigned_t<T>(x)); }
constexpr static inline ll len(const Z &a) { return a.size(); }

void reverse(Z &a) { reverse(all(a)); }

void unique(Z &a) {
  sort(a);
  a.erase(unique(all(a)), a.end());
}
TE vc<int> inverse(const vc<T> &a) {
  int N = len(a);
  vc<int> b(N, -1);
  FOR(i, N) if (a[i] != -1) b[a[i]] = i;
  return b;
}

Z QMAX(const Z &a) { return *max_element(all(a)); }
Z QMIN(const Z &a) { return *min_element(all(a)); }
constexpr bool chmax(Z &a, const Z &b) { return (a < b ? a = b, 1 : 0); }
constexpr bool chmin(Z &a, const Z &b) { return (a > b ? a = b, 1 : 0); }

vc<int> argsort(const Z &a) {
  vc<int> I(len(a));
  iota(all(I), 0);
  sort(I, [&](int i, int k) { return a[i] < a[k] or (a[i] == a[k] and i < k); });
  return I;
}
TE vc<T> rearrange(const vc<T> &a, const vc<int> &I) {
  int N = len(I);
  vc<T> b(N);
  FOR(i, N) b[i] = a[I[i]];
  return b;
}
template <int of = 1, typename T> 
vc<T> pre_sum(const vc<T> &a) {
  int N = len(a);
  vc<T> c(N + 1);
  FOR(i, N) c[i + 1] = c[i] + a[i];
  if (of == 0) c.erase(c.begin());
  return c;
}

TE constexpr static int topbit(T x) {
  if (x == 0) return - 1;
  if constexpr (sizeof(T) <= 4) return 31 - __builtin_clz(x);
  else return 63 - __builtin_clzll(x);
}
TE constexpr static int lowbit(T x) {
  if (x == 0) return -1;
  if constexpr (sizeof(T) <= 4) return __builtin_ctz(x);
  else return __builtin_ctzll(x);
}

TE constexpr T floor(T x, T y) { return x / y - (x % y and (x ^ y) < 0); }
TE constexpr T ceil(T x, T y) { return floor(x + y - 1, y); }
TE constexpr T bmod(T x, T y) { return x - floor(x, y) * y; }
TE constexpr pair<T, T> divmod(T x, T y) {
  T q = floor(x, y);
  return pair{q, x - q * y};
}
template <typename T = ll>
T SUM(const Z &v) {
  return accumulate(all(v), T(0));
}
int lb(const Z &a, Z x) { return lower_bound(all(a), x) - a.begin(); }
int lb(Z l, Z r, Z x) requires(is_same_v<decltype(l), decltype(r)>) { return lower_bound(l, r, x) - l; }
int ub(const Z &a, Z x) { return upper_bound(all(a), x) - a.begin(); }
int ub(Z l, Z r, Z x) requires(is_same_v<decltype(l), decltype(r)>) { return upper_bound(l, r, x) - l; }

template <bool ck = 1>
ll bina(Z f, ll l, ll r) {
  if constexpr (ck) assert(f(l));
  while (abs(l - r) > 1) {
    ll x = (r + l) >> 1;
    (f(x) ? l : r) = x;
  }
  return l;
}
TE T bina_real(Z f, T l, T r, int c = 100) {
  while (c--) {
    T x = (l + r) / 2;
    (f(x) ? l : r) = x;
  }
  return (l + r) / 2;
}

Z pop(Z &s) {
  if constexpr (requires { s.pop_back(); }) {
    Z x = s.back();
    return s.pop_back(), x;
  } else if constexpr (requires { s.top(); }) {
    Z x = s.top();
    return s.pop(), x;
  } else {
    Z x = s.front();
    return s.pop(), x;
  }
}
void setp(int x) { cout << fixed << setprecision(x); }

TE inline void sh(vc<T> &a, int N, T b = {}) {
  a.resize(N, b);
}
#line 1 "YRS/debug.hpp"
#ifdef YRSD
void DBG() { cerr << "]" << endl; }
TES void DBG(T &&x, S &&...y) {
  cerr << x;
  if constexpr (sizeof...(S)) cerr << ", ";
  DBG(forward<S>(y)...);
}
#define debug(...) cerr << "[" << __LINE__ << "]: [" #__VA_ARGS__ "] = [", DBG(__VA_ARGS__)
void ERR() { cerr << endl; }
TES void ERR(T &&x, S &&...y) {
  cerr << x;
  if constexpr (sizeof...(S)) cerr << ", ";
  ERR(forward<S>(y)...);
}
#define err(...) cerr << "[" << __LINE__ << "]: ", ERR(__VA_ARGS__)
#define asser assert
#else
#define debug(...) void(0721)
#define err(...)   void(0721)
#define asser(...) void(0721)
#endif
#line 4 "No_121_\u50be\u5411\u3068\u5bfe\u7b56_\u9580\u677e\u5217_\u305d\u306e.cpp"
// #include "YRS/IO/fast_io.hpp"
// #include "YRS/random/rng.hpp"
// #include "YRS/mod/mint.hpp"
#line 2 "YRS/ds/fenw/fenw.hpp"

template <typename mono>
  requires requires(typename mono::X x) { mono::inv(x); }
struct fenw {
  using MX = mono;
  using X = MX::X;
  int N;
  vc<X> a;
  X tot;

  fenw() {}
  fenw(int N) { build(N); }
  fenw(int N, Z f) { build(N, f); }
  fenw(const vc<X>& v) { build(v); }

  void build(int M) {
    N = M, tot = MX::unit();
    a.assign(M, MX::unit());
  }
  void build(const vc<X>& v) {
    build(len(v), [&](int i) -> X { return v[i]; });
  }
  void build(int M, Z f) {
    N = M;
    a.resize(N);
    FOR(i, N) a[i] = f(i);
    FOR(i, 1, N + 1) {
      int k = i + (i & -i);
      if (k <= N) a[k - 1] = MX::op(a[i - 1], a[k - 1]);
    }
    tot = prod(M);
  }

  X prod(int k) {
    chmin(k, N);
    X res = MX::unit();
    for (;k > 0; k -= k & -k) res = MX::op(res, a[k - 1]);
    return res;
  }
  X prod(int l, int r) {
    chmax(l, 0), chmin(r, N);
    if (l >= r) return MX::unit();
    if (not l) return prod(r);
    assert(0 <= l and l <= r and r <= N);
    X ad = MX::unit(), in = MX::unit();
    while (l < r) ad = MX::op(ad, a[r - 1]), r -= r & -r;
    while (r < l) in = MX::op(in, a[l - 1]), l -= l & -l;
    return MX::op(ad, MX::inv(in));
  }
  X prod_all() { return tot; }
  
  vc<X> get_all() {
    vc<X> res(N);
    FOR(i, N) res[i] = prod(i, i + 1);
    return res;
  }

  void multiply(int i, X x) {
    static_assert(MX::commute);
    tot = MX::op(tot, x);
    for (++i; i <= N; i += i & -i) a[i - 1] = MX::op(a[i - 1], x);
  }
  void set(int i, X x) { multiply(i, MX::op(MX::inv(prod(i, i + 1)), x)); }

  int max_right(Z f, int L = 0) {
    assert(f(MX::unit()));
    X s = MX::unit();
    int i = L;
    int k = [&]() -> int {
      while (1) {
        if (i % 2 == 1) s = MX::op(s, MX::inv(a[i - 1])), i -= 1;
        if (i == 0) return topbit(N) + 1;
        int k = lowbit(i) - 1;
        if (i + (1 << k) > N) return k;
        X t = MX::op(s, a[i + (1 << k) - 1]);
        if (not f(t)) return k;
        s = MX::op(s, MX::inv(a[i - 1])), i -= i & -i;
      }
    }();
    while (k) {
      --k;
      if (i + (1 << k) - 1 < N) {
        X t = MX::op(s, a[i + (1 << k) - 1]);
        if (f(t)) i += (1 << k), s = t;
      }
    }
    return i;
  }
  int kth(X k, int L = 0) {
    return max_right([&k](X x) { return x <= k; }, L);
  }

  // f(i, x)
  int max_right_with_index(Z f, int L = 0) {
    assert(f(L, MX::unit()));
    X s = MX::unit();
    int i = L;
    int k = [&]() {
      while (1) {
        if (i % 2 == 1) s = MX::op(s, MX::inv(a[i - 1])), i -= 1;
        if (i == 0) return topbit(N) + 1;
        int k = lowbit(i) - 1;
        if (i + (1 << k) > N) return k;
        X t = MX::op(s, a[i + (1 << k) - 1]);
        if (not f(i + (1 << k), t)) return k;
        s = MX::op(s, MX::inv(a[i - 1])), i -= i & -i;
      }
    }();
    while (k) {
      --k;
      if (i + (1 << k) - 1 < len(a)) {
        X t = MX::op(s, a[i + (1 << k) - 1]);
        if (f(i + (1 << k), t)) i += (1 << k), s = t;
      }
    }
    return i;
  }
  int min_left(Z f, int R) {
    assert(f(MX::unit()));
    X s = MX::unit();
    int i = R, k = 0;
    while (i > 0 && f(s)) {
      s = MX::op(s, a[i - 1]);
      k = lowbit(i);
      i -= i & -i;
    }
    if (f(s)) return assert(i == 0), 0;
    while (k) {
      --k;
      X t = MX::op(s, MX::inv(a[i + (1 << k) - 1]));
      if (not f(t)) i += (1 << k), s = t;
    }
    return i + 1;
  }
};
#line 2 "YRS/al/m/add.hpp"

template <typename T>
struct monoid_add {
  using X = T;
  static constexpr X op(const X &x, const X &y) noexcept { return x + y; }
  static constexpr X inv(const X &x) noexcept { return -x; }
  static constexpr X pow(const X &x, ll n) noexcept { return X(n) * x; }
  static constexpr X unit() { return X(0); }
  static constexpr bool commute = 1;
};
#line 9 "No_121_\u50be\u5411\u3068\u5bfe\u7b56_\u9580\u677e\u5217_\u305d\u306e.cpp"

#define tests 0
#define fl 0
#define DB 10
using MX = monoid_add<ll>;
using BIT = fenw<MX>;
void Yorisou() {
  INT(N);
  VEC(int, a, N);
  vc<int> f(a);
  unique(f);
  for (int &x : a) x = lb(f, x);

  BIT l(N), r(N), c(N);
  for (int x : a) r.multiply(x, 1);
  ll s = 0;
  for (int x : a) {
    s += l.prod(x) * r.prod(x);
    s += l.prod(x + 1, N) * r.prod(x + 1, N);
    s -= c.prod_all() - c.prod(x, x + 1);
    ll lx = l.prod(x, x + 1), rx = r.prod(x, x + 1);
    c.multiply(x, -lx * rx);
    c.multiply(x, (lx + 1) * (rx - 1));
    r.multiply(x, -1);
    l.multiply(x, 1);
  }
  print(s);
}
#line 1 "YRS/aa/main.hpp"
int main() {
  cin.tie(nullptr)->sync_with_stdio(0);
  int T = 1;
  if (fl) cerr.tie(0);
  if (tests and not fl) IN(T);
  for (int i = 0; i < T or fl; ++i) {
    Yorisou();
    if (fl and i % DB == 0) cerr << "Case: " << i << '\n';
  }
  return 0;
}
#line 38 "No_121_\u50be\u5411\u3068\u5bfe\u7b56_\u9580\u677e\u5217_\u305d\u306e.cpp"