1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <set>
#include <map>
#include <string>
#include <queue>
#include <stack>
#include <unordered_map>
#include <bitset>
using namespace std;

typedef long long int LL;
typedef long double LD;
typedef vector<int> VI;
typedef vector<LL> VLL;
typedef vector<LD> VLD;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;

const int INF = 1000000001;
const LD EPS = 10e-9;

#define FOR(x, b, e) for(int x = b; x <= (e); ++x)
#define FORD(x, b, e) for(int x = b; x >= (e); --x)
#define REP(x, n) for(int x = 0; x < (n); ++x)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define MP make_pair
#define PB push_back
#define ST first
#define ND second
#define abs(a) ((a)<0 ? -(a) : (a))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))

const int MAX_N = 5005;
const int MAX_A = 5005;
const LL P = 1000000007;

int n;
LL res;
LL a[MAX_N];
LL counts[MAX_N][MAX_A];
LL cumsCount[MAX_N][MAX_A];
LL largerCounts[MAX_N];
LL allSumsCount[MAX_N];

int main()
{
    ios_base::sync_with_stdio(0);

    cin >> n;
    for(int i = 1; i <= n; ++i)
    {
        cin >> a[i];
    }

    sort(a+1, a+n+1);

    counts[0][0] = 1;
    allSumsCount[0] = 1;
    for(int i = 1; i <= n; ++i)
    {
        for(int j = 0; j < MAX_A; ++j)
        {
            counts[i][j] = counts[i-1][j];
        }

        for(int j = a[i]-1; j < MAX_A; ++j)
        {
            if(j < MAX_A-a[i])
            {
                counts[i][j+a[i]] = (counts[i][j+a[i]] + counts[i-1][j]) % P;
            }
            else
            {
                largerCounts[i] = (largerCounts[i] + counts[i-1][j]) % P;
            }
        }
        largerCounts[i] = (largerCounts[i] + 2*largerCounts[i-1]) % P;

        cumsCount[i][0] = counts[i][0];
        for(int j = 1; j < MAX_A; ++j)
        {
            cumsCount[i][j] = (cumsCount[i][j-1] + counts[i][j]) % P;
        }

        allSumsCount[i] = (cumsCount[i][MAX_A-1] + largerCounts[i]) % P;
    }

    res = (allSumsCount[n]+P-1) % P;

    cout << res << endl;

    return 0;
}