#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <string>
#include <climits>
#include <functional>
#include "math.h"
using namespace std;
typedef long long ll;

int main() {
	ll mod = 1000000007;
    int T, a, b, c, d, e;
    cin >> T >> a >> b >> c >> d >> e;
	a = abs(a); b = abs(b); c = abs(c);	
	if (b < c) swap(b, c); if (a < b) swap(a, b);
	ll nums[20002] = {0};
	nums[10001] = 1;
	int l = 0; int r = 1;
	for (int i = 0; i < T; ++i) {
		l -= a; r += a;
		ll cur_nums[20002] = {0};
		for (int j = 10001 + l; j < 10001 + r; ++j) {
			if (nums[j] != 0) {
				cur_nums[j + a] += nums[j] % mod;
				cur_nums[j - a] += nums[j] % mod;
				cur_nums[j + b] += nums[j] % mod;
				cur_nums[j - b] += nums[j] % mod;
				cur_nums[j + c] += nums[j] % mod;
				cur_nums[j - c] += nums[j] % mod;
			}
		}
		swap(nums, cur_nums);			
	}
	ll ans = 0;
	for (int i = 10001 + d; i < 10002 + e; ++i) {
		ans += nums[i] % mod;
	}
	cout << ans % mod << endl;
}