#include<bits/stdc++.h>
#define FIO(file) freopen(file".in","r",stdin),freopen(file".out","w",stdout)
#include<ext/pb_ds/hash_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef unsigned long long ull;
const int N=1e6+5;
const int mod=1e9+7;

static char buf[1000000],*p1=buf,*p2=buf;
#define getchar() p1==p2&&(p2=(p1=buf)+fread(buf,1,1000000,stdin),p1==p2)?EOF:*p1++
inline int wrd(){int x=0,f=1;char c=getchar();while(c<'0' || c>'9'){if(c=='-') f=-1;c=getchar();}while(c>='0' && c<='9') {x=(x<<3)+(x<<1)+c-48;c=getchar();}return x*f;}
inline void write(int x){static char buf[20];static int len=-1;if(x<0)putchar('-'),x=-x;do buf[++len]=x%10,x/=10;while(x);while(len>=0)putchar(buf[len--]+48);}

int n,m,as,a[N];
int fac[N],inv[N];
ull base=13331,pw[55];
void ad(int &a,int b){(a+=b)>=mod&&(a-=mod);}
int qpw(int a,int b){
	int as=1;
	while(b){
		if(b&1) as=1ll*as*a%mod;
		a=1ll*a*a%mod,b>>=1;
	}
	return as;
}
void init(int n){
	pw[0]=1; for(int i=1;i<=50;++i) pw[i]=pw[i-1]*base;
	fac[0]=1; for(int i=1;i<=n;++i) fac[i]=1ll*fac[i-1]*i%mod;
	inv[n]=qpw(fac[n],mod-2); for(int i=n;i;--i) inv[i-1]=1ll*inv[i]*i%mod;
}
int C(int n,int m){
	if(n<m || m<0) return 0;
	return 1ll*fac[n]*inv[m]%mod*inv[n-m]%mod;
}

int lim,mx;
ull val;
array<int,51> c;
gp_hash_table<ull,int> mp;

int dfs(int x,int y,int z){
	if(y>=mx) return 1ll*z*fac[n-x+1]%mod;
	if(mp.find(val)!=mp.end()){return mp[val];}
	int cur=0;
	for(int i=1;i<=y;++i){
		if(!c[i]) continue;
		--c[i],val+=pw[i];
		int res=dfs(x+1,y+i,1ll*z*(c[i]+1)%mod);
		ad(cur,res),val-=pw[i],++c[i];
	}
	return mp[val]=cur;
}
void solve(){
	for(int i=1;i<=n;++i) ++c[a[i]];
	for(int i=1;i<=50;++i) if(c[i]) mx=i;
	lim=min(50,n);
	as=dfs(1,a[0],1);
	as=1ll*as*C(n+m,m)%mod*fac[m]%mod;
	write(as);
}

signed main(){
	//FIO("silver");
	n=wrd(),init(n);
	for(int i=0;i<=n;++i) a[i]=wrd();
	sort(a+1,a+n+1),reverse(a+1,a+n+1);
	while(n && !a[n]) --n,++m;
 	return solve(),0;
}