#include <iostream>
#include <vector>
#include <algorithm>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
#define all(a) (a).begin(), (a).end()
#define rep(i, n) for (int i = 0; i< (int)(n); i++) 
int inf = 1e9+7;
int gcd(int a, int b){
    if(a < b)swap(a, b);
    if(b == 0)return a;
    return gcd(b, a%b);
}
int lcm(int a, int b){
    int c = a/gcd(a, b);

    if(c <= inf/b){
        return b*c;
    }else{
        return inf;
    }
}

int main(){
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int n, a, b, c; cin >> n >> a >> b >> c;
    int ans = n/a + n/b + n/c;
    ans -= n/lcm(a, b) + n/lcm(b, c) + n/lcm(a, c);
    int lab = lcm(a, b);
    int labc = lcm(lab, c);
    ans += n/labc;
    cout << ans << endl;
    return 0;
}