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

LL gcd(LL a,LL b){
    return (b==0)?a:gcd(b,a%b);
}

// aとbの最小公倍数
// O(log (a+b) )
LL lcm(LL a,LL b){
    return (a*b)/gcd(a,b);
}


int main() {
    LL N;cin>>N;
    LL a,b,c;cin>>a>>b>>c;
    cout<<(N/a)+(N/b)+(N/c)-(N/lcm(a,b))-(N/lcm(b,c))-(N/lcm(c,a))+(N/lcm(a,lcm(b,c)))<<endl;
    return 0;
}