/*
    Author:zeke
    
    pass System Test!
    GET AC!!
*/
#include <iostream>
#include <queue>
#include <vector>
#include <iostream>
#include <vector>
#include <string>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <map>
#include <iomanip>
#include <utility>
#include <stack>
#include <bitset>
using ll = long long;
using ld = long double;
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define rep3(var, min, max) for (ll(var) = (min); (var) < (max); ++(var))
#define repi3(var, min, max) for (ll(var) = (max)-1; (var) + 1 > (min); --(var))
#define Mp(a, b) make_pair((a), (b))
#define F first
#define S second
#define Icin(s) \
    ll(s);      \
    cin >> (s);
#define Scin(s) \
    ll(s);      \
    cin >> (s);
template <class T>
bool chmax(T &a, const T &b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
    if (b < a)
    {
        a = b;
        return 1;
    }
    return 0;
}
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef vector<V> VV;
typedef vector<P> VP;
ll mod = 1e9 + 7;
ll MOD = 1e9 + 7;
ll INF = 1e18;

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll t;
    cin >> t;
    ll a, b, c, d, e;
    cin >> a >> b >> c >> d >> e;
    ll dx[] = {a,-a,b,-b,c,-c};
    VV dp(t + 1, V(30000));
    dp[0][15000] = 1;
    rep(i, t)
    {
        rep(j, 30000)
        {
            rep(k,6){
                if(j+dx[k]<30000&&j+dx[k]>=0){
                    dp[i + 1][j + dx[k]] += dp[i][j];
                    dp[i + 1][j + dx[k]] %= MOD;
                }
            }
        }
    }
    ll res = 0;
    rep3(i, 15000 + d, 15000 + e + 1)
    {
        res += dp[t][i];
        res %= MOD;
    }
    // cout<<dp[t][15001]<<endl;
    cout << res << endl;
}