#pragma GCC optimize("O3")
#include <bits/stdc++.h>
 
using namespace std;

const long long int MOD = 1e9 + 7;
long long int dp[501][20001];

int main(void)
{
	cin.tie(0);
	ios::sync_with_stdio(false);

	int n,a,b,c,d,e;

	cin >> n;
	cin >> a >> b >> c >> d >> e;
	d+=10000;
	e+=10000;

	dp[0][10000] = 1;

	for(int i=0;i<n;i++)
	{
		for(int j=0;j<=20000;j++)
		{
			if(dp[i][j]==0)
			{
				continue;
			}
			if(a+j>=0 && a+j<=20000)
			{	
				dp[i+1][a+j] += dp[i][j];
				dp[i+1][a+j]%=MOD;
			}
			if(j-a>=0 && j-a<=20000)
			{	
				dp[i+1][j-a] += dp[i][j];
				dp[i+1][j-a]%=MOD;
			}			
			if(b+j>=0 && b+j<=20000)
			{	
				dp[i+1][b+j] += dp[i][j];
				dp[i+1][b+j]%=MOD;
			}
			if(j-b>=0 && j-b<=20000)
			{	
				dp[i+1][j-b] += dp[i][j];
				dp[i+1][j-b]%=MOD;
			}	
			if(c+j>=0 && c+j<=20000)
			{	
				dp[i+1][c+j] += dp[i][j];
				dp[i+1][c+j]%=MOD;
			}
			if(j-c>=0 && j-c<=20000)
			{	
				dp[i+1][j-c] += dp[i][j];
				dp[i+1][j-c]%=MOD;
			}						
		}
	}

	long long int res = 0;

	for(int i=d;i<=e;i++)
	{
		res += dp[n][i];
		res%=MOD;
	}

	cout << res << '\n';

	return 0;
}