#include <bits/stdc++.h>
#define REP(i,n,N) for(int i=(n);i<(int) N;i++)
#define p(s) cout<<(s)<<endl
typedef long long ll;
using namespace std;
const ll mod=1e9+7;

ll cnt[110];
int main() {
	int N;
	cin>>N;
	REP(i,0,N){
		int a;
		cin>>a;
		cnt[a-1]++;
	}
	ll ans=0;
	REP(i,0,100){
		REP(j,i+1,100){
			REP(k,j+1,100){
				ans+=(cnt[i]*cnt[j]*cnt[k])%mod;
				ans%=mod;
			}
		}
	}
	p(ans);
	return 0;
}