def inv(x):
    return pow(x, MOD-2, MOD)

def C(n, r):
    if r>n:
        return 0
    return fact[n]*inv(fact[r])*inv(fact[n-r])

N = int(input())
A = list(map(int, input().split()))
MOD = 10**9+7

A.append(-1)
fact = [1]

for i in range(1, 10**5+100):
    fact.append(fact[-1]*i%MOD)
    
ans = C(N, 3)
c = 1

for i in range(N):
    if A[i]!=A[i+1]:
        ans -= C(c, 3)
        ans -= C(c, 2)*(N-c)
        c = 1
    else:
        c += 1

print(ans%MOD)