Kejal have N points, with coordinates (1, 0), (2, 0), ..., (N, 0). Every point has a color, point with coordinate (i, 0) has color C[i].

Kejal have painted arcs between every pair of points with same color. Formally Kejal painted arc between points (i, 0) and (j, 0) if C[i] = C[j] and i != j, such arc has color C[i]. All the arcs are painted such way that they will reside along the positive quadrant.

Now Kejal wants to know how many pairs of arc with different color intersect?

INPUT

First line contain integer N. Next line contain integers C[1], C[2], ..., C[N].

OUTPUT

In single line output answer modulo 1000000007 (10^9 + 7).

CONSTRAINTS
1 ≤ N ≤ 100000
1 ≤ C[i] ≤ 100000

SAMPLE INPUT
6
1 2 1 2 1 2

SAMPLE OUTPUT
6
rr = raw_input
N = int(rr())
A = map(int, rr().split())
from collections import defaultdict as ddic
G = ddic(int)
for i in A:
	G[i] += 1
#G is total count of everything
ans = 0
for i in xrange(N):
	cur = ddic(int)
	Ai = A[i]
	for j in xrange(i+1,N):
		if Ai==A[j]:
			for k,v in cur.iteritems():
				if k>Ai: ans += cur[k]*(G[k]-v)
		cur[A[j]] += 1
print ans