#include<bits/stdc++.h>
//#pragma GCC optimize(2)
using namespace std;
#define pii pair<int,int>
#define ll long long
#define il inline
#define fst first
#define scd second
#define reg register
#define err() cout<<"err "<<__LINE__<<endl,exit(0)
#define pot(args...) \
	GPT(#args),cout<<"  Line "<<__LINE__<<"\t: ", \
	PPT(args),cout<<"\n\n"
#define rep(i,s,t) for(int i=(s);i<=(t);++i)
#define irep(i,t,s) for(int i=(t);i>=(s);--i)
void PPT(){}
template<typename TYPE,typename... TYPES>
void PPT(const TYPE& x,const TYPES&... y){cout<<x<<' ',PPT(y...);}
void GPT(string nam){cout<<setw(29)<<nam;}
il int read(int x=0,int f=1){
    char ch=getchar();
    while(ch<'0'||ch>'9')f=(ch=='-'?-1:1),ch=getchar();
    while(ch>='0'&&ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
    return x*f;
}
il void write(int x){
    char F[200];
    int tmp=x>0?x:-x;
    if(x<0)putchar('-');
    if(x==0)putchar('0');
    int cnt=0;
    while(tmp>0){
	    F[cnt++]=tmp%10+'0';
        tmp/=10;
    }
    while(cnt>0)putchar(F[--cnt]);
}
const int P=999999956,mod=1e9+7;
int qp(int a,int b){
	int r=1;
	while(b){
		if(b&1)r=1ll*r*a%mod;
		a=1ll*a*a%mod;b>>=1;
	}
	return r;
}
int n;
void work(){
	int ans=1,tot=1;
	rep(i,1,n){
		int a;cin>>a;
		ans=1ll*ans*(P-a)%mod;
		tot=1ll*tot*a%mod;
		tot=mod-tot;
	}
	ans=(ans-tot)%mod;
	ans=1ll*ans*qp(P,mod-2)%mod;
	cout<<(ans%mod+mod)%mod<<'\n';
}
signed main(){
	ios::sync_with_stdio(false);
	while(cin>>n){
		work();
	}
}