#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <functional>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cctype>
#include <string>
#include <cstring>

using namespace std;

typedef long long ll;

#define MODN 1000000007

int main() {
  ll n;
  cin >> n;
  ll memo[101];
  memset(memo, 0, sizeof(memo));
  ll a[n];
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    memo[a[i]]++;
  }
  ll ans = 0;
  for (int i = 0; i < 101; i++) {
    for (int j = i+1; j < 101; j++) {
      for (int k = j+1; k < 101; k++) {
	ans += memo[i]*memo[j]*memo[k];
      }
    }
  }
  ans %= MODN;
  cout << ans << endl;
}