#include <bits/stdc++.h>
using namespace std;
const int N=100010;
const long long Mod=1e9+7;
int n;
long long dp[N][11],a[N];
int main () {
freopen("enumerate.in","r",stdin);
freopen("enumerate.out","w",stdout);
cin>>n;
for (int i=1;i<=n;i++)
{
scanf("%lld",&a[i]);
}
dp[0][0]=1;
for (int i=1;i<=n;i++)
{
dp[i][0]=1;
for (int j=1;j<=4;j++)
{
dp[i][j]=dp[i-1][j]+dp[i-1][j-1]*a[i];
dp[i][j]%=Mod;
}
}
printf("%lld",dp[n][4]);
}