#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
typedef long long ll;

const int MOD = 1e9 + 7;
ll num[100005];
int main()
{
  FOR(i,0,100005) num[i] = 0;
  ll N;
  cin>>N;
  ll cnt = 0;
  FOR(i,0,N) {
    int in;
    cin >> in;
    if(num[in]==0) cnt++;
    num[in]++;
  }
  ll ans = N*(N-1)/2*(N-2)/3;
  ans %= MOD;
  FOR(i,0,100005) {
    ll n = num[i];
    if(n>1) {
      ans -= (n*(n-1)/2*(N-n)) % MOD;
      ans = (ans + MOD) % MOD;
    }
    if(n>2) {
      ans -= (n*(n-1)/2*(n-2)/3) % MOD;
      ans = (ans + MOD) % MOD;
    }
  }
  cout << ans % MOD << endl;
  return 0;
}