import core.thread;
import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.range, std.regex;

//	Input
class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { tokens = readln.split; if (stdin.eof) throw new EOFException; } auto token = tokens[0]; tokens.popFront; return token; }
int readInt() { return to!int(readToken); }
long readLong() { return to!long(readToken); }
real readReal() { return to!real(readToken); }

//	chmin/chmax
void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

//	Pair
struct Pair(S, T) {
	S x; T y;
	int opCmp(    const Pair p) const { return (x < p.x) ? -1 : (x > p.x) ? +1 : (y < p.y) ? -1 : (y > p.y) ? +1 : 0; }
	int opCmp(ref const Pair p) const { return (x < p.x) ? -1 : (x > p.x) ? +1 : (y < p.y) ? -1 : (y > p.y) ? +1 : 0; }
	string toString() const { return "(" ~ to!string(x) ~ ", " ~ to!string(y) ~ ")"; }
}
auto pair(S, T)(inout(S) x, inout(T) y) { return Pair!(S, T)(x, y); }

//	Array
int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = as.length; for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) { return (a <  val); }); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) { return (a <= val); }); }
T[] unique(T)(in T[] as) { T[] bs; foreach (a; as) if (bs.empty || bs[$ - 1] != a) bs ~= a; return bs; }


int N;
int[] A;

void main(string[] args) {
	try {
	for (; ; ) {
		N = readInt;
		A = new int[N];
		foreach (i; 0 .. N) {
			A[i] = readInt;
		}
		
		auto L = new long[][](2, N);
		auto R = new long[][](2, N);
		foreach (s; 0 .. 2) {
			auto ps = new Pair!(int, int)[N];
			foreach (i; 0 .. N) {
				ps[i] = pair(s ? -A[i] : +A[i], i);
			}
			ps.sort();
			auto fen = new long[N];
			void add(int pos) {
				for (int x = pos; x < N; x |= x + 1) {
					++fen[x];
				}
			}
			int sum(int pos) {
				int ret;
				for (int x = pos - 1; x >= 0; x = (x & (x + 1)) - 1) {
					ret += fen[x];
				}
				return ret;
			}
			for (int j = 0, k; j < N; j = k) {
				for (k = j; k < N && ps[j].x == ps[k].x; ++k) {}
				foreach (p; ps[j .. k]) {
					const i = p.y;
					L[s][i] = sum(i);
					R[s][i] = j - L[s][i];
				}
				foreach (p; ps[j .. k]) {
					const i = p.y;
					add(i);
				}
			}
		}
debug{
writeln("L = ",L);
writeln("R = ",R);
}
		long ans;
		foreach (i; 0 .. N) {
			ans += L[0][i] * L[1][i];
			ans += R[0][i] * R[1][i];
		}
		writeln(ans);
	}
	} catch (EOFException) {}
}