#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
 
using namespace std;

#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(int i=(a);i<(b);++i)
#define clr(a, b) memset((a), (b) ,sizeof(a))

#define MOD 1000000007

int main(){
  int n;
  cin>>n;
  vector<int> v;
  rep(i,0,n){
    int a;
    cin>>a;
    v.pb(a);
  }
  int d[101];
  clr(d,0);
  rep(i,0,v.sz){
    d[v[i]]++;
  }
  rep(i,1,101){
    d[i]+=d[i-1];
  }
  sort(all(v));
  long long ans = 0LL;
  rep(i,0,v.sz){
    int a = d[v[i]-1];
    int b = d[100]-d[v[i]];
    ans += a*b;
    ans %= MOD;
  }
  cout << ans << endl;
  return 0;
}