#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    int n;
    cin >> n;
    ll f[110] = {};
    rep(i,n){
        int a;
        cin >> a;
        f[a]++;
    }

    ll ans = 0;
    ll MOD = 1000000007;

    rep(i,110){
        srep(j,i+1,110){
            srep(k,j+1,110){
                ans += f[i] * f[j] * f[k];
                ans %= MOD;
            }
        }
    }

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