#include<cstdio>

#include<cstring>

#include<algorithm>

using namespace std;

typedef long long  ll;

int n,A,B,x,y;

const ll mod=1000000007;

ll dp[10005];

int main (){

    while(~scanf("%d%d%d%d%d",&n,&x,&y,&A,&B)){

        if(A>B)

            swap(A,B);

        memset(dp,0,sizeof(dp));

        dp[0]=1;

        ll ed=max(A,max(B-A,n-B));

        for(int i=1;i<=ed;i++){

            if(i>=x)(dp[i]+=dp[i-x])%=mod;

            if(i>=y)(dp[i]+=dp[i-y])%=mod;

        }

        ll ans=((dp[A]%mod)*(dp[B-A]%mod))%mod;

        ans=((ans%mod)*(dp[n-B]%mod))%mod;

        printf("%lld\n",ans);

    }

    return 0;

}