#include <algorithm>
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>

using namespace std;
using ll = long long;
#define rep(i, j, n) for (int i = j; i < (n); ++i)
#define rrep(i, j, n) for (int i = (n)-1; j <= i; --i)
template <typename T>
std::istream &operator>>(std::istream &is, std::vector<T> &a) {
  for (T &x : a) { is >> x; }
  return is;
}
constexpr int MOD = 1000000007;
ll dp[10010];

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int n;
  cin >> n;
  vector<int> p(n);
  cin >> p;
  dp[0] = 1;
  rep(i, 0, n) rrep(j, p[i], 10010) dp[j] += dp[j - p[i]];

  ll ans = 0;
  rep(i, 1, 10010) {
    int q = i / 100;
    int r = i % 100;
    if (r == 50) continue;
    if (r > 50) ++q;
    if (q & 1) (ans += dp[i]) %= MOD;
  }
  cout << ans;
  return 0;
}