import java.io.*;
import java.util.*;


class Main {
    static final long MOD=1000000007;
    static final int N=2000;
    static long[] fact;
    static long[] invfact;
    static void initialize() {
	fact = new long[N];
	invfact = new long[N];
	fact[0] = invfact[0] = 1;
	for (int i = 1; i < N; ++i) {
	    fact[i] = (i * fact[i - 1]) % MOD;
	    invfact[i] = powerMod(fact[i], MOD - 2);
	}
    }
    static long powerMod(long x, long exponent) {
	long prod = 1;
	for (int i = 63; i >= 0; --i) {
	    prod = (prod * prod) % MOD;
	    if ((exponent & 1L << i) != 0) {
		prod = (prod * x) % MOD;
	    }
	}
	return prod;
    }
    static long comb(int x, int y) {
	if (x < 0) {
	    return 0;
	}
	if (y < 0 || y > x) {
	    return 0;
	}
	long r= (fact[x] * powerMod((fact[x - y] * fact[y]) % MOD, MOD - 2)) % MOD;
	return r;
    }
    public static void main(String[] args) {
        MyScanner sc = new MyScanner();
        out = new PrintWriter(new BufferedOutputStream(System.out));
        int t=sc.nextInt();
        int[] a=new int[3];
        for(int i=0;i<3;++i)a[i]=sc.nextInt();
        int d=sc.nextInt();
        int e=sc.nextInt();
        if(a[2]<0){
            for(int i=0;i<3;++i)a[i]=-a[i];
            int tmp=d;
            d=-e;
            e=-tmp;
        }
        initialize();
        long[][]prec=new long[t+1][2*t+2];
        for(int i=0;i<=t;++i){
            for(int z=-t;z<=t;++z){
                int az=Math.abs(z);
                if((az+i)%2!=0)continue;
                int j=(i-z)/2;
                prec[i][z+t+1]=j>=0&&j+z>=0?invfact[j]*invfact[j+z]%MOD:0;
            }
            for(int j=0;j<2*t+1;++j)
                prec[i][j+1]=(prec[i][j+1]+prec[i][j])%MOD;
        }
        long wa=0;
        for(int x=-t;x<=t;++x){
            int ax=Math.abs(x);
            int tx=t-ax;
            for(int y=-tx;y<=tx;++y){
                int ay=Math.abs(y);
                int ty=tx-ay;
                int zMin=-ty,zMax=ty;
                if(a[2]!=0){
                    zMin=Math.max(zMin,(d-a[0]*x-a[1]*y+100000*a[2]+a[2]-1)/a[2]-100000);
                    zMax=Math.min(zMax,(e-a[0]*x-a[1]*y+100000*a[2])/a[2]-100000);
                }else if(d-a[0]*x-a[1]*y>0||e-a[0]*x-a[1]*y<0)
                    continue;
                if(zMin>zMax)continue;
                //System.err.println("x = "+x+" y = "+y);
                //System.err.println("zMin = "+zMin+" zMax = "+zMax);
                //System.err.println(Arrays.toString(d2));
                long tmp=0;
                for(int i=ax+ay;i<=t;i+=2){
                    long adden=prec[t-i][t+zMax+1]-prec[t-i][t+zMin]+MOD;
                    adden%=MOD;
                    long d2=comb(i,(i-ax-ay)/2)*comb(i,(i-ax+ay)/2)%MOD;
                    d2=d2*invfact[i]%MOD;
                    adden=adden*d2%MOD;
                    tmp=(tmp+adden)%MOD;
                }
                wa=(wa+tmp)%MOD;
            }
        }
        out.println(wa*fact[t]%MOD);
        out.close();
    }
    // http://codeforces.com/blog/entry/7018
    //-----------PrintWriter for faster output---------------------------------
    public static PrintWriter out;
    //-----------MyScanner class for faster input----------
    public static class MyScanner {
        BufferedReader br;
        StringTokenizer st;
        public MyScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }
        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
        int nextInt() {
            return Integer.parseInt(next());
        }
        long nextLong() {
            return Long.parseLong(next());
        }
        double nextDouble() {
            return Double.parseDouble(next());
        }
        String nextLine(){
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
}