#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstring>
#include <map>

#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<30
#define MOD 1000000007

using namespace std;
typedef long long ll;

ll memo[100005][5];
ll nCr(ll n,ll r)
{
    if(n < r) return 0;
    if(n == r) return 1;
    if(r == 1) return n;
    if(memo[n][r] != -1) return memo[n][r];

    return memo[n][r] = (nCr(n-1,r)+nCr(n-1,r-1))%MOD;
}

int main()
{
	int n;
	cin >> n;
	
	vector<int> v(n);
    map<int,ll> m;
    int vmin = INF, vmax = 0;
    rep(i,n) {
        cin >> v[i];
        m[v[i]]++;

        vmin = min(vmin,v[i]);
        vmax = max(vmax,v[i]);
    }

    ll ans = 0;
    REP(i,vmin,vmax+1) {
        REP(j,i+1,vmax+1) {
            REP(k,j+1,vmax+1) {
                ans += m[i] * m[j] * m[k];
                ans %= MOD;
            }
        }
    }

    cout << ans << endl;


	return 0;
}