#include <bits/stdc++.h>

using namespace std;

typedef pair <int, int> ii;
typedef long long ll;

const int mod = 1000000007;
const int inv2 = 500000004;
const int Maxn = 200005;
const int Maxm = 1000005;

int n;
int A[Maxn];
int S[Maxn], S2[Maxn];
vector <int> inds[Maxm];
int cur;
set <ii> G;
int got[200][200];
vector <int> seq;

int F(int len)
{
    return ll(len) * (len + 1) % mod * inv2 % mod;
}

int GetS2(int x) { return x <0? 0:S2[x]; }

int Solve(int a, int b)
{
    //cout <<"Solve(" <<a <<" " <<b <<endl;
    if (a == 0) return S[b];
    if (b == 0) return S[a];
    int tk = min(a, b - 1);
    int res = (GetS2(a + b - 1) - GetS2(a + b - 1 - 2 *tk) + mod) % mod;
    res = (res + F(b)) % mod;
    res= (res + S[a - tk]) % mod;
    res = (res + S[b - 1 - tk]) % mod;
    return res;
}

int solveEnd(int a)
{
    set <ii>::iterator it = G.begin();
    if (it != G.end() && it->first == 1)
        return Solve(a, it->second - it->first + 1);
    return Solve(a, 0);
}

int solveBegin(int b)
{
    set <ii>::iterator it = G.end();
    if (it != G.begin()) {
        it--;
        if (it->second == n) return Solve(it->second - it->first +1, b);
        else return Solve(0, b);
    }
    return Solve(0, b);
}

void Insert(int x)
{
    int lef = x, rig = x;
    set <ii>::iterator it = G.lower_bound(ii(x + 1, 0)), it2;
    it2 = it;
    if (it != G.begin()) {
        it--;
        if (it->second == x - 1) {
            lef = it->first;
            if (it->first == 1) cur = (cur - solveBegin(it->second - it->first + 1) + mod) % mod;
            else cur = (cur - S[it->second - it->first + 1] + mod) % mod;
            G.erase(it);
        }
    } else if (x == 1) cur = (cur - solveBegin(0) +mod) % mod;
    //cout <<"befcur = " <<cur <<endl;
    if (it2 != G.end() && it2->first == x + 1) {
        rig = it2->second;
        if (it2->second == n) cur = (cur - solveEnd(it2->second - it2->first +1) +mod) % mod;
        else cur = (cur - S[it2->second - it2->first + 1] + mod) % mod;
        G.erase(it2);
    } else if (x == n) cur = (cur - solveEnd(0) + mod) % mod;
    //cout << "curcur = " <<cur << endl;
    if (lef == 1) {
        //cur = (cur - solveBegin(0) + mod) % mod;
        cur = (cur + solveBegin(rig - lef + 1)) % mod;
    }
    else if (rig == n) {
        //cur = (cur - solveEnd(0) +mod) % mod;
        cur = (cur + solveEnd(rig - lef +1)) % mod;
    }
    else cur = (cur + S[rig - lef + 1]) % mod;
    G.insert(ii(lef, rig));
    //cout <<lef <<" and " << rig <<endl;
    //printf("ins %d, cur = %d", x, cur); cout <<endl;
}

int main() {
    scanf("%d", &n);
    int mx = 0;
    for (int i = 1; i <= n; i++) {
        scanf("%d", &A[i]);
        mx = max(mx, A[i]);   
        inds[A[i]].push_back(i);
    }
    for (int i = 1; i < Maxn; i++) {
        S[i] = (S[i - 1] +F(i)) % mod;
        S2[i] = F(i);
        if (i >= 2) S2[i] = (S2[i] +S2[i - 2]) % mod;
    }
    int tot = 0;
    int lst = 0;
    for (int i = 0; i < mx; i++) {
        for (int j = 0; j < inds[i].size(); j++) {
            Insert(inds[i][j]);
           // printf("%d - %d", inds[i][j], cur); cout <<endl;
        }
        int my = (cur - lst +mod) % mod;
        tot = (tot +ll(my) *i) % mod;
        //if (i <= 1) {printf("i = %d, cur = %d", i, cur); cout << endl; }
        lst = cur;
    }
    cur = F(F(n));
    int my = (cur - lst + mod) % mod;
    tot = (tot + ll(my) * mx) % mod;
    printf("%d\n", tot);
   /* int cres = 0;
    for (int i = 1; i <=n; i++) {
        int has = 0;
        for (int j = 0; i + j <= n; j++) {
            has = max(has, A[i + j]);
            got[i][j] = has;
        }
    }
    for (int j = 0; j < n; j++)
        for (int i = 1; i + j <= n; i++)
            seq.push_back(got[i][j]);
    for (int i = 0; i <seq.size(); i++)
        printf("%d ", seq[i]);
    cout <<endl;
    for (int i = 0; i < seq.size(); i++) {
        int has = 0;
        for (int j = i; j < seq.size(); j++) {
            has = max(has, seq[j]);
            cres = (cres +  has) % mod;
        }
    }
    printf("%d", cres);*/
    return 0;
}