#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int N = 1e6 + 9;
const int mod = 1e9 + 7;
ll a[N];
ll s3[N], s2[N],s1[N];

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int n;
    while(cin >> n)
    {
        for(int i = 1; i <= n; i ++)
        {
            cin >> a[i];
        }
        s1[n + 1] = s2[n + 1] = s2[n + 1] = 0;
        for(int i = n; i >= 1; i --)
        {
            s1[i] = (s1[i + 1] + a[i]) % mod;
            s2[i] = (s2[i + 1] + (a[i] * a[i]) % mod) % mod;
            s3[i] = (s3[i + 1] + (((a[i] * a[i]) % mod) * a[i]) % mod) % mod;
        } 
        ll ans = 0;
        for(int i = 1; i + 3 <= n; i ++)
        {
            ll n1 = ((s1[i + 1] * s1[i + 1]) % mod * s1[i + 1])% mod;
            ll n2 = ((3 * s2[i + 1]) % mod * s1[i + 1])%mod;
            ll n3 = (2 * s3[i + 1])%mod;
            ll n4 = ((n1 - n2 + n3) * 166666668 + mod) % mod;

            ans = (ans +(a[i] * n4) % mod) % mod;
        }
        cout << ans % mod << endl;
    }

    return 0;
}