#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(int i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long int ll;
using namespace std;
const int mod=1e9+7;

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