//Author: Kevin5307
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
const ll mod=1000000007;
ll ksm(ll a,ll b)
{
	if(!b) return 1ll;
	if(b%2) return ksm(a*a%mod,b/2)*a%mod;
	return ksm(a*a%mod,b/2);
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int n;
	const ll inv=ksm(mod-51,mod-2);
	while(cin>>n)
	{
		ll ans=1;
		ll xx=1;
		while(n--)
		{
			ll x;
			scanf("%lld",&x);
			ans=ans*(mod-51-x)%mod;
			xx=xx*x%mod;
		}
		printf("%lld\n",(ans-xx+mod)%mod*inv%mod);
	}
	return 0;
}