#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

int N;
ll A[3];

template<typename T>
T gcd(T a, T b){
    if(b == 0){return a;}
    return gcd(b, a % b);
}

template<typename T>
T lcm(T a, T b){
    T g = gcd(a, b);
    return a / g * b;
}

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

    std::cin >> N;

    for(int i=0;i<3;++i){
        std::cin >> A[i];
    }

    int res = 0ll;
    for(int i=1;i<8;++i){
        ll x = 1ll;
        for(int j=0;j<3;++j){
            if(i >> j & 1){
                x = lcm(x, A[j]);
            }
        }

        int sgn = __builtin_popcount(i) % 2 == 1 ? (+1) : (-1);
        res += sgn * (N / x);
    }

    std::cout << res << std::endl;
}