#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define op(x) ((x&1)?x+1:x-1)
#define odd(x) (x&1)
#define even(x) (!odd(x))
#define lc(x) (x<<1)
#define rc(x) (lc(x)|1)
#define lowbit(x) (x&-x)
#define mp(x,y) make_pair(x,y)
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
using namespace std;
const int MAXN=1e5+10,mod=1e9+7;
ll mypow(ll a,ll n){
	if(!n)return 1;
	ll tmp=mypow(a,n/2);tmp=tmp*tmp%mod;
	if(n&1)tmp=tmp*a%mod;return tmp;
}
ll myinv(ll a){return mypow(a,mod-2);}
void add(ll& x,ll y){x=(x+y)%mod;}
void sub(ll& x,ll y){x=(x-y+mod)%mod;}
//
ll T,n,a[MAXN];
ll ans,P=1e10+19;

void solve(){
	rep(i,1,n)cin>>a[i];

	ans=1;
	rep(i,1,n){
		ll val=(mod-1)*a[i]%mod;
		add(val,P%mod);

		ans=ans*val%mod;
	}
	ll val=1,flag=1;
	rep(i,1,n){
		val=val*(mod-1)%mod*a[i]%mod;
		flag&=(a[i]>0);
	}
	sub(ans,val);
	ans=ans*myinv((P%mod))%mod;

	if(flag){
		if(odd(n))sub(ans,1);
		else add(ans,1);
	}

	cout<<ans<<"\n";
}
int main(){

	ios::sync_with_stdio(false);
	while(cin>>n)solve();


    return 0;
}