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

typedef long long ll;

ll gcd(ll a,ll b){ //最大公約数 O(log(min(a,b)))
    if(b==0) return a;
    return gcd(b,a%b);
}

ll lcm(ll a,ll b){ //最小公倍数
    ll gc=gcd(a,b);
    ll ans=(a*b)/gc;
    return ans;
}

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