/*
Things to notice:
1. do not calculate useless values
2. do not use similar names
 
Things to check:
1. submit the correct file
2. time (it is log^2 or log)
3. memory
4. prove your naive thoughts 
5. long long
6. corner case like n=0,1,inf or n=m
7. check if there is a mistake in the ds or other tools you use
8. fileio in some oi-contest

9. module on time 
10. the number of a same divisor in a math problem
11. multi-information and queries for dp and ds problems
*/
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pii pair<long long,long long>
#define mp make_pair
#define pb push_back
const int mod=1e9+7;
const int inf=0x3f3f3f3f;
const int INF=1e18;
int fpow(int x,int b)
{
	if(b==0) return 1;
	if(x==0) return 0;
	int res=1;
	while(b>0)
	{
		if(b&1)	res=1LL*res*x%mod;
		x=1LL*x*x%mod;
		b>>=1;
	}
	return res;
}
int fac[300005],ifac[300005];
int C(int x,int y)
{
	if(y>x) return 0;
	if(x==y||y==0) return 1;
	return 1LL*fac[x]*ifac[x-y]%mod*ifac[y]%mod;
}
void init(int x)
{
	fac[0]=fac[1]=1;
	for(int i=2;i<=x;i++) fac[i]=1LL*fac[i-1]*i%mod;
	ifac[x]=fpow(fac[x],mod-2);  // x should be less than mod!!!
	for(int i=x-1;i>=0;i--) ifac[i]=1LL*ifac[i+1]*(i+1)%mod;
}
int n,a[55],ok1[55],pw[1005];
int calc(int x)
{
	if(x>=n) return 1;
	int res=0;
	for(int i=0;i<=x;i++) 
	{
		int nw=C(n,i);
		if(i&1) nw=mod-nw;
		nw=nw*pw[x-i]%mod*ifac[n]%mod;
		res=(res+nw)%mod;
	}
	return res;
}
const int B=2000;
int f[2005],g[2005],h[2005];
void add(int &x,int y)
{
	x+=y;
	if(x>=mod) x-=mod;
}
int Ctmp[1005][1005];

int Calc()
{
	memset(f,0,sizeof(f)),memset(g,0,sizeof(g)),memset(h,0,sizeof(h));
	f[1]+=a[50];
	for(int i=49,coefp=1;i>=0;i--)
	{
		memset(g,0,sizeof(g));
		for(int j=0;j<=B;j++) add(g[min(B,2*j)],f[j]);
		add(g[1],a[i]*coefp%mod);
		memset(h,0,sizeof(h));
		int Q=fpow(fpow(2,mod-2),ok1[i]);
		coefp=coefp*Q%mod;
		for(int j=0;j<=B;j++) if(g[j]) 
		{
			int tmp=g[j]*Q%mod;
			for(int l=0;l<=min(j,ok1[i]);l++) add(h[j-l],tmp*Ctmp[ok1[i]][l]%mod);
		}
		for(int j=0;j<=B;j++) f[j]=h[j];
	}
	int res=0;
	for(int i=0;i<=B;i++) add(res,h[i]*calc(i)%mod);
	return res;
}
void solve()
{
	init(10000);
	cin>>n;
	for(int i=0;i<=n;i++) for(int j=0;j<=i;j++) Ctmp[i][j]=C(i,j);
	for(int i=1;i<=n;i++) 
	{
		int x;
		cin>>x;
		a[x]++;
		for(int j=0;j<x;j++) ok1[j]++;
	}
	for(int i=0;i<=n;i++) pw[i]=fpow(i,n);
	int ans=Calc();
//	for(int i=0;i<=n;i++) cout<<calc(i)<<"\n";
//	for(int i=0;i<=50;i++) if(a[i]) ans=(ans+a[i]*Calc(i))%mod;
	
	cout<<(mod+1-ans)%mod<<"\n";
}
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int _=1;
//	cin>>_;
	while(_--) solve();
	return 0;
}