#include <stdio.h>
#include <algorithm>

using namespace std;

#define FIN "plus.in"
#define FOUT "plus.out"
#define ll long long

ll S, sgn[3], cnt[3], Res;

ll solve(ll s1, ll c1, ll s2, ll c2, ll x)
{
    ll l, r;

    if (!s1 && !s2) return !x*(c1+1)*(c2+1);
    if (!s2) return solve(s2, c2, s1, c1, x);
    if (!s1) return (0 <= x/s2 && x/s2 <= c2)*(c1+1);
    if (s1 == -1 && s2 == -1) return solve(1, c1, 1, c2, -x);
    if (s2 == -1) return solve(s2, c2, s1, c1, x);
    l = s2*x; r = s2*(x-c1);
    if (l > r) swap(l, r);
    l = max(l, 0LL); r = min(r, c2);
    return max(0LL, r-l+1);
}

int main(void)
{
    int i; 

    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);

    scanf("%lld", &S);
    for (i = 0; i < 3; ++i)
        scanf("%lld %lld", cnt+i, sgn+i);

    for (i = 0; i <= cnt[0]; ++i)
        Res += solve(sgn[1], cnt[1], sgn[2], cnt[2], S-sgn[0]*i);
    printf("%lld\n", Res);

    return 0;
}