// ,,廿_廿,,
#include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;

int main() {
    int n;
    cin >> n;
    map<int, int> count;
    vector<int> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    const long mod = 1e9 + 7;
    sort(begin(a), end(a));
    long ans = 0;
    for (int i = 0; i < n; ++i) {
        int pre = lower_bound(begin(a), end(a), a[i]) - begin(a);
        int suf = end(a) - upper_bound(begin(a), end(a), a[i]);
        long res = (long)pre * suf;
        ans += res;
        ans %= mod;
    }
    cout << ans << endl;
}