#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll P=10000000019;
const int mod=1e9+7;
const int N=1e5+5;
ll ksm(ll x,ll y)
{
	if(!y)return 1;
	ll res=ksm(x,y/2);
	res=res*res%mod;
	if(y%2)res=res*x%mod;
	return res;
}
int n,a[N];ll inv;
void solve()
{
	if(n==1){
		cin>>n;
		cout<<1<<"\n";
		return;
	}
	ll ans,cur=ksm(P%mod,n-1);ans=cur;cur=1;
	for(int i=0;i<n;i++)
	{
		cin>>a[i];cur=cur*a[i]%mod;
		ll val=ans*inv%mod*a[i]%mod;
		ans=(ans-val+mod)%mod;
	}
	if(n%2==0)ans=(ans-cur+mod)%mod;
	else ans=(ans+cur)%mod;
	cout<<ans<<"\n";return;
}
int main(){
	inv=ksm(P%mod,mod-2);
	while(cin>>n)solve();
	/*
	ll ans=0;
	for(int i=0;i<(1<<n)-1;i++)
	{
		int sz=__builtin_popcount(i);
		int tot=n-sz;ll val=1;
		for(int j=0;j<n;j++)
			if((i>>j)&1)
				val=val*a[j]%mod;
		val=val*ksm(P%mod,tot-1)%mod;
	//	cout<<i<<" "<<val<<"##\n";
		if(sz%2==0)ans+=val;
		else ans-=val;
		ans%=mod;
	}ans+=mod;ans%=mod;
	cout<<ans;//<<" "<<P%mod;*/
	return 0;
}