#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))

// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;

int t;
int a,b,c,d,e;
const int C = 12525;
ll dp[2][25252];

int main(){
  scanf("%d%d%d%d%d%d",&t,&a,&b,&c,&d,&e);
  a = abs(a);
  b = abs(b);
  c = abs(c);
  dp[0][C] = 1;
  int mn = C, mx = C;
  while(t--){
    REP(i,25252)dp[1][i] = 0;
    FOR(i,mn,mx+1){
      int x = dp[0][i];
      (dp[1][i-a] += x) %= MOD;
      (dp[1][i+a] += x) %= MOD;
      (dp[1][i-b] += x) %= MOD;
      (dp[1][i+b] += x) %= MOD;
      (dp[1][i-c] += x) %= MOD;
      (dp[1][i+c] += x) %= MOD;
    }
    mn -= max({a,b,c});
    mx += max({a,b,c});
    REP(i,25252)dp[0][i] = dp[1][i];
  }
  ll ans = 0;
  FOR(i,C+d,C+e+1){
    ans += dp[0][i];
    ans %= MOD;
  }
  cout<<ans<<endl;
  return 0;
}