#include <iostream>
#include <cstdio>
#include <cstdlib>
#define int long long
using namespace std;
const int p=1e10+19;
const int mod=1e9+7;
// FAST IO
//#define FREAD_USED
inline char gc() {
	#ifndef FREAD_USED
	return getchar();
	#else
	const int size=100005;
	static char buf[size],*p1=buf+size,*p2=buf+size;
	if(p1==p2)p2=(p1=buf)+fread(buf,1,size,stdin);
	return p1==p2?-1:*p1++;
	#endif
}
template<typename t=int> inline t read() {
	char ch=gc();
	t sum=0,s=1;
	while(ch<'0'||ch>'9'){
		if((ch=gc())=='-')s=-1;
		if(ch==-1) exit(0);
	}
	while(ch>='0'&&ch<='9')sum=sum*10+ch-48,ch=gc();
	return sum*s;
}
template<typename t> inline void write(t x){
	if(x<0) putchar('-'),x=-x;
	if(x<10){
		putchar(x+48);
		return;
	}
	write(x/10);
	putchar(x%10+48);
}
//FAST IO END
const int N=1e5+100;
int n,a[N];
int pre[N],suf[N];
signed main(){
	while(true){
		n=read();
		for(int i=1;i<=n;i++){
			a[i]=read();
		}
//		puts("hi");
		pre[0]=1;
		for(int i=1;i<=n;i++){
			pre[i]=pre[i-1]*(p-a[i])%mod;
		}
//		puts("1");
		suf[n+1]=1;
		for(int i=n;i;i--){
			suf[i]=suf[i+1]*a[i]%mod;
		}
//		puts("2");
//		for(int i=1;i<=n;i++){
//			write(pre[i]);putchar(' ');write(suf[i]);putchar('\n');
//		}
		int ans=0;
		for(int i=n;i>=1;i--){
			ans+=pre[i-1]*suf[i+1]%mod*(i%2!=n%2?-1:1);
			ans=(ans%mod+mod)%mod;
		}
//		puts("hi");
		write(ans);
		puts("");
	}
}