#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;

#define RREP(i,s,e) for (int i = e-1; i >= s; i--)
#define rrep(i,n) RREP(i,0,n)
#define REP(i,s,e) for (int i = s; i < e; i++)
#define rep(i,n) REP(i,0,n)

map<pair<int,int>,int> comb;

int combination(int n, int k) {
    int ret;
    pair<int,int> p {n,k};
    if (comb.count(p))
        return comb[p];
    if (n == k || k == 0)
        return 1;
    else {
        comb[p] = (combination(n-1,k) + combination(n-1,k-1)) % 1000000007;
        return comb[p];
    }
}

int main() {
    int n;
    cin >> n;
    map<int,int> a;
    rep(i,n) {
        int x;
        cin >> x;
        a[x]++;
    }
    
    long long ans = combination(a.size(),3);
    for (auto p : a)
        ans = (ans + ans * 3 * (p.second-1) / a.size()) % 1000000007;

    cout << ans << endl;
    return 0;
}