//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(a) (a).begin(), (a).end()
using ll = long long;
const ll INF32 = 2e9;
const ll INF64 = 4e18;
using namespace atcoder;
using mint = modint998244353;

// 勘.

void printYN(bool ok){
    if(ok)cout << "Yes" << endl;
    else cout << "No" << endl;
    return;
}

int main() {    
    ll N, P, Q, R, A, B, C;
    cin >> N >> P >> Q >> R >> A >> B >> C;
    while(A!=B||B!=C){
        if(A<B){
            A+=P;
        }
        if(B<A){
            B+=Q;
        }
        if(B<C){
            B+=Q;
        }
        if(C<B){
            C+=R;
        }
        if(C<A){
            C+=R;
        }
        if(A<C){
            A+=P;
        }
        if(A>N||B>N||C>N){
            cout << 0 << endl;
            return 0;
        }
    }
    cout << (N-A)/lcm(P, lcm(Q, R))+1 << endl;
    return 0;
}