#include <algorithm>
#include <cstdint>
#include <iostream>
#include <vector>

using namespace std;

constexpr int mod = 1e9 + 7, C = 51, N = 1e3 + 1;

using poly = vector<int>;

auto& mul(auto&& a, auto... b) { return ((a = a * (uint64_t)b % mod), ...); }
auto& add(auto&& a, auto... b) { return ((a -= (a += b) >= mod? mod: 0), ...); }
auto& adp(auto&& a, auto b, auto c) { return (a = (a + (uint64_t)b * c) % mod); }
auto& mad(auto&& a, auto b, auto c) { return (a = (a * (uint64_t)b + c) % mod); }
int inv_(int a) { for (int r = 1, b = mod - 2; ; mul(a, a), b /= 2) if (b % 2) mul(r, a); else if (!b) return r; }
poly dif(poly p, poly q) { if (p.size() < q.size()) p.resize(q.size()); for (int i = 0; i < q.size(); ++i) add(p[i], mod - q[i]); return p; }

int eval(const poly& p, int x) {
  int res = 0;
  for (int i = p.size(); i--; ) mad(res, x, p[i]);
  return res;
}

int inv[N];

poly ade(poly p) {
  for (int i = 0; i < p.size(); ++i) mul(p[i], inv[i + 1]);
  p.insert(p.begin(), 0);
  return p;
}

poly ksb(poly a, poly b) {
  poly res(a.size() + b.size() - 1);
  if (min(a.size(), b.size()) < 64) {
    for (int i = 0; i < a.size(); ++i)
    for (int j = 0; j < b.size(); ++j) adp(res[i + j], a[i], b[j]);
    return res;
  }
  int s = (max(a.size(), b.size()) + 1) / 2;
//  if (s == 58) cout << a.size() << ' ' << b.size() << ' ' << s << '\n';
  a.resize(s * 2);
  b.resize(s * 2);
  poly l = ksb({a.begin(), a.begin() + s}, {b.begin(), b.begin() + s});
  poly r = ksb({a.begin() + s, a.end()}, {b.begin() + s, b.end()});
  for (int i = 0; i < s; ++i) add(a[i], a[i + s]);
  for (int i = 0; i < s; ++i) add(b[i], b[i + s]);
  poly m = ksb({a.begin(), a.begin() + s}, {b.begin(), b.begin() + s});
  copy(l.begin(), l.end(), res.begin());
  copy_n(r.begin(), res.size() - s * 2, res.begin() + s * 2);
  for (int i = 0; i < min(m.size(), res.size() - s); ++i) res[i + s] = (res[i + s] + m[i] + 2ull * mod - l[i] - r[i]) % mod;
  return res;
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  for (int i = 1; i < N; ++i) inv[i] = inv_(i);
  int n; cin >> n;
  int c0[C]{}, cnt[C]{};
  for (int i = 0, x; i < n; ++i) cin >> x, ++c0[x], cnt[x - !!x] += !!x;
  for (int i = C; --i; ) cnt[i - 1] += cnt[i];
  vector<poly> cont{{1}, {0}}, nx;
  for (int i = 1; i < n; ++i) {
    poly pp;
    for (int i = 0; auto& p: cont) {
      p = ade(p);
      uint64_t s = 0;
      for (auto& x: pp) s += x;
      pp.resize(max(pp.size(), p.size()));
      for (int i = 0; i < p.size(); ++i) pp[i] = add(+p[i], mod - pp[i]);
      for (int i = p.size(); i < pp.size(); ++i) pp[i] = mod - pp[i];
      add(pp[0], s % mod);
      nx.push_back(move(pp));
      swap(pp, p);
    }
    nx.push_back({0});
    swap(cont = {}, nx);
  }
  vector<int> e(n);
  for (int i = 0; i < n; ++i) e[i] = add(eval(ade(cont[i]), 1), e[i - !!i]);
  int ans = 0;
  vector<poly> coef;
  for (int c = 0; c < C; ++c) if (cnt[c]) {
    poly cur{1};
    for (int j = cnt[c]; j--; ) {
      cur.push_back(0);
      for (int i = 0, p = 0, t; i < cur.size(); ++i) t = p, p = cur[i], cur[i] = mul(t + p, mod / 2 + 1);
    }
    coef.push_back(cur);
  }
  for (int c = C; c--; ) if (c0[c]) {
    vector<int> dens{{1}}, ndens;
    int64_t mins = 1 - (1ll << c), maxs = n - 2 + mins, L = 0;
    for (int i = C; i--; ) maxs += 1ll * cnt[i] << i;
    int cans = 0;
    for (int i = C; i--; ) if (cnt[i]) {
      for (auto& x: dens) ndens.push_back(x), ndens.push_back(0);
      swap(dens = {}, ndens);
      dens.pop_back();
      L *= 2;
      dens = ksb(dens, coef[i]);
      maxs -= 0ll + cnt[i] - (i < c) << i;
      mins += 0ll + (i < c) << i;
      L -= i < c;
      while (-L > maxs >> i) add(cans, dens[0]), dens.erase(dens.begin()), ++L;
      while ((int)dens.size() + L - 1 > -mins >> i) dens.pop_back();
    }
    for (int i = 0; L <= 0; ++i) add(cans, mul(+dens[i], e[-L++]));
    add(ans, mul(cans, c0[c]));
  }
  cout << add(1, mod - ans) << '\n';
}