#include <bits/stdc++.h>

using namespace std;

#define int long long

signed main()
{
    int n;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; ++i)
    {
        cin >> a[i];
    }
    sort(a.begin(), a.end());
    vector<vector<int> > dp(n + 1);
    for (int i = 0; i <= n; ++i)
    {
        dp[i].resize(a[n - 1] + 1);
    }
    int cnt = 0;
    int k = 0;
    dp[0][0] = 1;
    for (int i = 1; i <= n; ++i)
     {
        cnt = (cnt + k) % (1000000007);
        for (int j = 0; j <= a[n - 1]; ++j)
        {
            if (dp[i - 1][j] > 0 && a[i - 1] + j > a[n - 1])
            {
                k += dp[i - 1][j] + k;
            }
        }
        for (int j = 0; j <= a[n - 1]; ++j)
        {
            dp[i][j] = dp[i - 1][j];
            if (j >= a[i - 1])
            {
                dp[i][j] += dp[i - 1][j - a[i - 1]];
                if (j > a[i - 1])
                {
                    cnt += dp[i - 1][j];
                    cnt = cnt % (1000000007);
                }
            }
        }
    }
    cout << cnt;
}