#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()

typedef long long ll;
typedef pair<int, int> P;

const ll mod = 1e9 + 7;

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);

    ll N;
    cin >> N;
    vector<ll> cnt(100, 0);
    rep(i, N) {
        ll a;
        cin >> a;
        a--;
        cnt[a]++;
    }

    ll ans = 0;
    rep(k, 100) rep(j, k) rep(i, j) {
        ans += cnt[i] * cnt[j] * cnt[k];
    }

    cout << ans % mod << endl;

}