#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 1e6 + 10;
const ll P = 1e9 + 7;
ll t, n, m;
ll a[N];
ll b[N];
ll pre[N];
ll suf[N];
void ac() {
	while (cin >> n) {
        for(int i = 0;i<=n+3;i++)
        {
            suf[i] = 0;
            pre[i] = 0;
            b[i] = 0;
            a[i] = 0;
        }
		for (int i = 1; i <= n; i++) {
			cin >> a[i];
			pre[i] = pre[i - 1] + a[i];
            pre[i]%=P;
		}
		for(int i = n;i>=1;i--)
		{
			suf[i] = suf[i+1]+a[i];
            suf[i]%=P;
		}
		if (n <= 3) {
			cout << "0\n";
		} else {
			b[2] = (a[1]%P * a[2]%P)%P;
//			b[3] = b[2]+pre[2]*a[3];
			ll ans=0;
			for(int i = 3;i<n;i++)
			{
				ans+=(((a[i]%P)*(b[i-1]%P))%P*(suf[i+1])%P)%P;
				ans%=P;
				b[i] = ((b[i-1]%P)+((pre[i-1]%P)*(a[i]%P))%P)%P;
				b[i]%=P;
			}
     
			cout<<(ans+P)%P<<"\n";
		}
	}
}
int main() {
	ios::sync_with_stdio(0);
	cin.tie();
	cout.tie();
	t = 1;
	while (t--) {
		ac();
	}
}