#include<iostream>
using namespace std;
int T;
int a,b,c,d,e;
long mod=1e9+7;
long comb[501][501],combsum[501][501];
long power(long a,long b){return b?power(a*a%mod,b/2)*(b%2?a:1)%mod:1;}
main()
{
	cin>>T>>a>>b>>c>>d>>e;
	comb[0][0]=1;
	combsum[0][0]=1;
	for(int i=1;i<=T;i++)
	{
		comb[i][0]=comb[i][i]=1;
		for(int j=1;j<i;j++)comb[i][j]=(comb[i-1][j-1]+comb[i-1][j])%mod;
		combsum[i][0]=1;
		for(int j=1;j<=i;j++)combsum[i][j]=(comb[i][j]+combsum[i][j-1])%mod;
	}
	long ans=0;
	for(int i=0;i<=T;i++)for(int ii=0;ii<=T-i;ii++)
	{
		int x=i-ii;
		int Tr=T-i-ii;
		long XW=comb[T][i]*comb[T-i][ii]%mod;
		for(int j=0;j<=Tr;j++)for(int jj=0;jj<=Tr-j;jj++)
		{
			int y=j-jj;
			long XYW=XW*comb[Tr][j]%mod*comb[Tr-j][jj]%mod;
			int Z=Tr-j-jj;
			int D=d-a*x-b*y+c*Z;
			int E=e-a*x-b*y+c*Z;
			int L=0,R=Z;
			if(c==0);
			else if(c>0)
			{
				L=max(L,D/(2*c));
				if(2*c*L<D)L++;
				R=min(R,E/(2*c));
				if(2*c*R>E)R--;
			}
			else
			{
				L=max(L,E/(-2*c));
				if(2*c*L>E)L++;
				R=min(R,D/(-2*c));
				if(2*c*R<D)R--;
			}
			if(L<=R&&D<=2*c*L&&2*c*R<=E)
			{
				long t=(combsum[Z][R]+mod-(L==0?0:combsum[Z][L-1]))%mod;
				(ans+=t*XYW)%=mod;
			}
		}
	}
	cout<<ans<<endl;
}