#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)

const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;

vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }


int main() {
  ll T; cin >> T;
  ll a, b, c, d, e; cin >> a >> b >> c >> d >> e;
  a = abs(a); b = abs(b); c = abs(c);

  ll M = 100000;
  vector<ll> dp(2*M+1); dp[M] = 1;
  rep(i,T) {
    vector<ll> tmp(2*M+1);
    rep(j,2*M+1) {
      if (j-a>=0  ) tmp[j-a] = (tmp[j-a] + dp[j]) % MOD;
      if (j+a<=2*M) tmp[j+a] = (tmp[j+a] + dp[j]) % MOD;
      if (j-b>=0  ) tmp[j-b] = (tmp[j-b] + dp[j]) % MOD;
      if (j+b<=2*M) tmp[j+b] = (tmp[j+b] + dp[j]) % MOD;
      if (j-c>=0  ) tmp[j-c] = (tmp[j-c] + dp[j]) % MOD;
      if (j+c<=2*M) tmp[j+c] = (tmp[j+c] + dp[j]) % MOD;
    }
    copy(all(tmp), dp.begin());
  }
  // debug(all(dp));

  ll result = 0; repr(i,d+M,e+M+1) result = (result+dp[i]) % MOD;
  cout << result << endl;
  return 0;
}