#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; //#define int long long typedef long long ll; typedef unsigned long long ul; typedef unsigned int ui; constexpr ll mod = 998244353; const ll INF = mod * mod; typedef pairP; #define stop char nyaa;cin>>nyaa; #define rep(i,n) for(int i=0;i=0;i--) #define Rep(i,sta,n) for(int i=sta;i=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) #define all(v) (v).begin(),(v).end() typedef pair LP; typedef long double ld; typedef pair LDP; const ld eps = 1e-12; const ld pi = acos(-1.0); ll mod_pow(ll x, ll n, ll m) { ll res = 1; while (n) { if (n & 1)res = res * x % m; x = x * x % m; n >>= 1; } return res; } struct modint { ll n; modint() :n(0) { ; } modint(ll m) :n(m) { if (n >= mod)n %= mod; else if (n < 0)n = (n % mod + mod) % mod; } operator int() { return n; } }; bool operator==(modint a, modint b) { return a.n == b.n; } modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; } modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; } modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; } modint operator+(modint a, modint b) { return a += b; } modint operator-(modint a, modint b) { return a -= b; } modint operator*(modint a, modint b) { return a *= b; } modint operator^(modint a, int n) { if (n == 0)return modint(1); modint res = (a * a) ^ (n / 2); if (n % 2)res = res * a; return res; } ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); } modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); } const int max_n = 1 << 18; modint fact[max_n], factinv[max_n]; void init_f() { fact[0] = modint(1); for (int i = 0; i < max_n - 1; i++) { fact[i + 1] = fact[i] * modint(i + 1); } factinv[max_n - 1] = modint(1) / fact[max_n - 1]; for (int i = max_n - 2; i >= 0; i--) { factinv[i] = factinv[i + 1] * modint(i + 1); } } modint comb(int a, int b) { if (a < 0 || b < 0 || a < b)return 0; return fact[a] * factinv[b] * factinv[a - b]; } struct BIT { private: vector node; int n; public: BIT(int n_) { n = n_; node.resize(n, 0); } //0-indexed void add(int a, ll w) { for (int i = a; i < n; i |= i + 1)node[i] += w; } //[0,a) ll sum(int a) { ll ret = 0; for (int i = a - 1; i >= 0; i = (i & (i + 1)) - 1)ret += node[i]; return ret; } //[a,b) ll sum(int a, int b) { return sum(b) - sum(a); } }; ll calc(vector v,int sup) { int n = v.size(); BIT btle(sup); vector le(n), ri(n); rep(i, n) { le[i] = btle.sum(v[i]); btle.add(v[i], 1); } BIT btri(sup); per(i, n) { ri[i] = btri.sum(v[i]); btri.add(v[i], 1); } ll ans = 0; rep(i, n)ans += le[i] * ri[i]; vector> loc(sup); rep(i, n)loc[v[i]].push_back(i); BIT bt(n); per(i, sup) { int sz = loc[i].size(); rep(j, sz - 1) { ll cl = j + 1; ll cr = sz - j-1; ll num = bt.sum(loc[i][j], loc[i][j + 1]); ans -= cl * cr * num; } for (int id : loc[i])bt.add(id, 1); } return ans; } void solve() { int n; cin >> n; vector a(n); rep(i, n)cin >> a[i]; vector cop = a; sort(all(cop)); cop.erase(unique(all(cop)), cop.end()); int sup = cop.size(); rep(i, n) { a[i] = lower_bound(all(cop), a[i]) - cop.begin(); } ll ans = calc(a, sup); rep(i, a.size())a[i] = sup - 1 - a[i]; ans += calc(a, sup); cout << ans << "\n"; } signed main() { ios::sync_with_stdio(false); cin.tie(0); //cout << fixed << setprecision(10); //init_f(); //int t; cin >> t; rep(i, t) solve(); return 0; }