#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
#define sz(a) ((int) (a).size())
#define vi vector < int >
#define me(a, x) memset(a, x, sizeof(a))
#define ull unsigned long long
#define ld __float128
#define pb emplace_back
using namespace std;
#define i128 __int128
using namespace std; 
const int mod = 1e9 + 7, _G = 3, N = 2007, inv2 = (mod + 1) / 2;
#define add(a, b) (a + b >= mod ? a + b - mod : a + b)
#define dec(a, b) (a < b ? a - b + mod : a - b)
int qpow(int x, int y = mod - 2) {
	int res = 1;
	for(; y; x = (ll) x * x % mod, y >>= 1) if(y & 1) res = (ll) res * x % mod;
	return res;
}
int fac[N + 1], ifac[N + 1], inv[N + 1];
void init(int x) {
	fac[0] = ifac[0] = inv[1] = 1;
	L(i, 2, x) inv[i] = (ll) inv[mod % i] * (mod - mod / i) % mod;
	L(i, 1, x) fac[i] = (ll) fac[i - 1] * i % mod, ifac[i] = (ll) ifac[i - 1] * inv[i] % mod;
}
int C(int x, int y) {
	return y < 0 || x < y ? 0 : (ll) fac[x] * ifac[y] % mod * ifac[x - y] % mod;
}
inline int sgn(int x) {
	return (x & 1) ? (mod - 1) : 1;
}

int n;
int cnt[N];

int ex[N];
int f[N][N], g[N][N];
int main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n;
	init(1007);
	int mul = 1;
	L(i, 1, n) {
		int c;
		cin >> c;
		mul = (ll)mul * qpow(inv2, c) % mod;
		++cnt[c];
	}
	int ans = 0;
	int cur = 0;
	f[0][0] = 1;
	L(p, 0, 50) {
		L(i, 0, n) {
			int pw = (ll) qpow(2, i * p) * ifac[i] % mod;
			(ans += (ll) pw * f[0][n - i] % mod * cnt[p] % mod) %= mod;
		}
		L(r, 1, cnt[p]) {
			R(i, cur, 0) {
				L(j, 0, n) {
					(f[i + 1][j] += mod - f[i][j]) %= mod;
				}
			}
			++cur;
		}
		L(i, 0, n) {
			ex[i] = (ll) qpow(mod - qpow(2, p), i) * ifac[i] % mod;
		}
		L(i, 0, cur)L(j, 0, n)g[i][j] = 0;
		L(i, 0, cur) {
			if(i % 2 == 0) {
				L(j, 0, n) (g[i / 2][j] += f[i][j]) %= mod;
			} else {
				L(j, 0, n) L(k, 0, n - j) (g[i / 2][j + k] += (ll) f[i][j] * ex[k] % mod) %= mod;
			}
		}
		L(i, 0, cur) L(j, 0, n) f[i][j] = 0;
		cur /= 2;
		L(i, 0, cur) L(j, 0, n) f[i][j] = g[i][j];
	}
	cout << (mod + 1 - (ll)ans * mul % mod) % mod << '\n';
	return 0;
}
/*
1 + 1 + 4^3 - 3^3 - 3^3 + 2^3
64-54+8+2=20
/ 6 / 4
*/