#include <iostream>
#include <vector>

using lint = long long;

constexpr int X = 100;
constexpr lint MOD = 1000000007;

void solve() {
    std::vector<lint> cnt(X, 0);

    int n;
    std::cin >> n;

    while (n--) {
        int x;
        std::cin >> x;
        ++cnt[--x];
    }

    lint ans = 0;
    for (int k = 0; k < X; ++k) {
        for (int j = 0; j < k; ++j) {
            for (int i = 0; i < j; ++i) {
                ans += cnt[i] * cnt[j] * cnt[k];
            }
        }
    }

    std::cout << ans % MOD << std::endl;
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}