#include <bits/stdc++.h>
using namespace std;

long long eazymod(long long a,long long m){a %= m; if(a < 0) a += m; return a;}
pair<long long,long long> invgcd(long long a,long long b){
    //return {gcd(a,b),x} (xa≡g(mod b))
    a = eazymod(a,b);
    if(a == 0) return {b,0};
    long long x = 0,y = 1,memob = b;
    while(a){
        long long q = b/a;
        b -= a*q;
        swap(x,y); y -= q*x;
        swap(a,b);
    }
    if(x < 0) x += memob/b;
    return {b,x};
}
 
pair<long long,long long> CRT(vector<long long> A,vector<long long> M){
    int n = A.size(); //0 <= Ai < Mi,|A| = |M|
    long long x = 0,lcm = 1;
    for(int i=0; i<n; i++){
        long long a = A.at(i)%M.at(i),m = M.at(i);
        if(lcm < m) swap(lcm,m),swap(x,a);
        if(lcm%m == 0){
            if(x%m != a) return {-1,-1};
            continue;
        }
        auto[g,in] = invgcd(lcm,m);
        if((a-x)%g) return {-1,-1};
 
        long long u1 = m/g;
        long long y = (a-x)/g %u1 * in %u1;
        x += y*lcm; lcm *= u1;
        if(x < 0) x += lcm;
    }
    return {x,lcm};
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    long long N; cin >> N;
    vector<long long> A(3),M(3);
    for(auto &m : M) cin >> m;
    for(auto &a : A) cin >> a;

    auto [x,lcm] = CRT(A,M);
    if(x == -1 || N < x){cout << 0 << endl; return 0;}
    long long answer = 1; N -= x;
    answer += N/lcm;
    cout << answer << endl;
}