#include "bits/stdc++.h"

#define rep(i,n) for(int i = 0;i < n;i++)
#define REP(i,n,k) for(int i = n;i < k;i++)
#define P(p) cout << (p) << endl;
#define sP(p) cout << setprecision(15) << fixed << p << endl;
#define pi 3.1415926535
#define IINF 1e9
#define LINF 1e18
#define vi vector<int>
#define mp make_pair
#define pb push_back

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int dx[] = { 0, 1, 0, -1 };
int dy[] = { -1, 0, 1, 0 };

unsigned long long sttoi(std::string str) {
	unsigned long long ret;
	std::stringstream ss; ss << str;
	ss >> ret;
	return ret;
}

ull gcd(ull a, ull b) {
	if (b > a)swap(a, b);
	if (b == 0) return a;
	return gcd(b, a%b);
}
void solve() {
  int n;
  cin >> n;
  ll mod = 1000000007;
  ll A[101];
  rep(i,101){
    A[i] = 0;
  }
  rep(i,n){
    int a;
    cin >> a;
    A[a]++;
  }
  ll sum = 0;
  REP(i,1,101)REP(j,i+1,101)REP(k,j+1,101){
    sum += A[i]*A[j]*A[k];
    sum %= mod;
  }
  sum %= mod;
  P(sum);
}

int main() {
  solve();
  return 0;
}