#include <cstdio>
#include <cmath>
#include <cstring>
#include <cassert>
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
#include <map>

template<typename T>
T pow(T x, long n) {
  T res = 1;
  T p = x;
  while( n != 0 ) {
    if( n & 0x01 ) res *= p;
    p *= p;
    n >>= 1;
  }
  return res;
}

template<long P = 1000000007>
class Mod {
public:
  Mod() : a(0) {}
  Mod(long x) : a(x) {}
  long get() { return a; }
  Mod operator + (Mod x) { return Mod<P>((a + x.get()) % P); }
  Mod operator += (Mod x) { a = (a + x.get()) % P; return *this; }
  Mod operator - (Mod x) { return Mod<P>((a + P - x.get()) % P); }
  Mod operator -= (Mod x) { a = (a + P - x.a) % P; return *this; }
  Mod operator * (Mod x) { return Mod<P>((a * x.get()) % P); }
  Mod operator *= (Mod x) { a = (a * x.a) % P; return *this; }
  Mod operator / (Mod x) { return *this * pow(x, P - 2); }
  Mod operator /= (Mod x) { a = (*this * pow(x, P - 2)); return *this; }
private:
  long a;
};

int N;
int B[128];
Mod<> B2[128];

int main() {
  scanf("%d", &N);
  for(int i = 0; i < (int)N; ++i) {
    int t;
    scanf("%d", &t);
    B[t] += 1;
  }
  for(int i = 1; i <= 100; ++i) {
    B2[i] = B[i];
  }
  
  Mod<> res = 0;
  for(int i = 1; i <= 100; ++i) {
    for(int j = i + 1; j <= 100; ++j) {
      for(int k = j + 1; k <= 100; ++k) {
        res += B2[i] * B2[j] * B2[k];
      }
    }
  }
  printf("%ld\n", res.get());
  
  return 0;
}