#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=1e3+5,M=100+5,K=1000+5,mod=1e9+7,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,A[N],siz[N];
ll p2[N],i2[N],frc[N],inv[N];
ll mpow(ll x,int y=mod-2){ll ans=1;while(y) y&1&&(ans=ans*x%mod),y>>=1,x=x*x%mod;return ans;}
ll C(int x,int y){return frc[x]*inv[y]%mod*inv[x-y]%mod;}
ll f[55][N],dp[N],g[N];
void Solve(){
	int i,j,h;scanf("%d",&n);
	inv[1]=1;for(i=2;i<=n;i++) inv[i]=(mod-inv[mod%i])*(mod/i)%mod;
	for(frc[0]=inv[0]=i=1;i<=n;i++) frc[i]=frc[i-1]*i%mod,inv[i]=inv[i-1]*inv[i]%mod;
	for(p2[0]=i2[0]=i=1;i<=50;i++) p2[i]=p2[i-1]*2%mod,i2[i]=i2[i-1]*(mod+1>>1)%mod;
	ll mul=1;
	for(i=1;i<=n;i++) scanf("%d",&A[i]),siz[A[i]]++,mul=mul*i2[A[i]]%mod;
	f[0][0]=1;
	for(i=1;i<=51;i++){
		static ll w[N];
		Me(w,0);
		for(int h=0;h<=siz[i-1];h++){
			ll ws=C(siz[i-1],h)*(h&1?mod-1:1)%mod;
			for(int j=0;j<=n;j++){
				w[j]=(w[j]+ws%mod*inv[j])%mod;
				ws=ws*(mod-p2[i-1]*h%mod)%mod;
			}
		}
		for(int j=0;j<=n;j++) if(f[i-1][j]) for(int h=j;h<=n;h++) f[i][h]=(f[i][h]+f[i-1][j]*w[h-j])%mod;
	}
	gdb(f[1][0]);
	ll ans=0;
	for(i=50;~i;i--){
		for(int j=1;j<=siz[i];j++){
			for(h=1;h<=n;h++) dp[h-1]=(dp[h-1]+mod-dp[h])%mod;
		}
		dp[1]=(dp[1]+siz[i])%mod;
		Mc(g,dp);Me(dp,0);
		for(int j=0;j<=n;j++){
			if(i&&j*2<=n){dp[j*2]=g[j];continue;}
			ll pw=1;
			for(int h=n;~h;h--) ans+=pw*f[i][h]%mod*g[j]%mod*inv[n-h]%mod*frc[n]%mod,pw=pw*j%mod*p2[i]%mod;
		}
	}
	ans=ans%mod*mul%mod*inv[n]%mod;
	printf("%lld\n",(mod+1-ans)%mod);
	gdb(ans*12%mod);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}