#include <bits/stdc++.h>

using namespace std;

const int N = 1005, M = 55, P = 1e9 + 7;

int jc[N], inv[N], pw[N], pw2[N];

int C(int x, int y) {
    return 1ll * jc[x] * inv[y] % P * inv[x - y] % P;
}

int ksm(int x, int y = P - 2) {
    int res = 1;
    while (y) {
        if (y & 1) res = 1ll * res * x % P;
        x = 1ll * x * x % P;
        y >>= 1;
    }
    return res;
}

int a[N], b[M], f[M][N << 1];

signed main() {
    int n, mx = 0; scanf("%d", &n);
    for (int i = jc[0] = inv[0] = 1; i <= n; ++i) {
        jc[i] = 1ll * jc[i - 1] * i % P;
        inv[i] = (i == 1 ? 1 : 1ll * (P - P / i) * inv[P % i] % P);
    }
    pw2[0] = 1;
    for (int i = 1; i <= n; ++i) {
        inv[i] = 1ll * inv[i - 1] * inv[i] % P;
        pw[i] = ksm(i, n);
        pw2[i] = ksm((P + 1) >> 1, i);
    }
    for (int i = 1; i <= n; ++i) {
        scanf("%d", &a[i]);
        mx = max(mx, a[i]);
        for (int j = 0; j < a[i]; ++j) ++b[j];
    }
    for (int i = 1; i <= n; ++i) {
        int s = 0;
        for (int j = 0; j < i; ++j) {
            s = (s + ((j & 1) ? P - 1ll : 1ll) * C(n, j) % P * pw[i - j] % P * inv[n]) % P;
        }
        f[0][i - 1] = s;
    }
    for (int i = n - 1; i; --i) {
        f[0][i] = (f[0][i] - f[0][i - 1] + P) % P;
    }
    for (int i = 1; i <= mx; ++i) {
        for (int j = 0; j <= n; ++j) {
            for (int k = 0; k <= b[i - 1] && k <= j * 2 + 1; ++k) {
                f[i][j] = (f[i][j] + 1ll * C(b[i - 1], k) * pw2[b[i - 1]] % P * ((j * 2 - k >= 0 ? f[i - 1][j * 2 - k] : 0) + f[i - 1][j * 2 - k + 1])) % P;
            }
        }
    }
    int res = 1;
    for (int i = 0; i <= mx; ++i) {
        int t = (!i ? n : b[i - 1]) - b[i], S = 1;
        for (int j = i; j < mx; ++j) S = 1ll * S * pw2[b[j]] % P;
        res = (res - 1ll * f[i][0] * S % P * t % P + P) % P;
    }
    printf("%d\n", res);
    return 0;
}