#include<bits/stdc++.h>

using namespace std;

const int N = 2e5 + 10, mod = 1e9 + 7;

typedef long long ll;

ll dp[N],a[N];
int n;

ll work(int i)
{
    ll sum = 0;
    sum += ((dp[i - 2] + mod) % mod + ((a[i - 1] % mod * a[i] % mod) % mod)) % mod;
    sum += ((dp[i - 2] + mod) % mod - ((a[i - 1] % mod * a[i] % mod) % mod)) % mod;
    sum += (((dp[i - 2] + mod) % mod) * ((a[i - 1] % mod * a[i] % mod) % mod)) % mod;
    return sum;
}

int main()
{
    scanf("%d",&n);
    for(int i = 0;i < n;i ++ ) scanf("%lld",&a[i]);
    dp[0] = a[0];
    for(int i = 1;i < n;i ++ )
    {
        if(i == 1)
        {
            dp[i] = ((dp[i - 1] % mod + a[i] % mod) % mod + ((dp[i - 1] % mod) - (a[i] % mod) + mod) % mod + (dp[i - 1] % mod * a[i] % mod) % mod) % mod;
        }
        else
        {
            dp[i] = ((dp[i - 1] % mod + a[i] % mod) % mod + ((dp[i - 1] % mod) - (a[i] % mod) + mod) % mod + work(i) % mod) % mod;
        }
    }
    printf("%lld\n",dp[n - 1]);
    return 0;
}