#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

typedef long long ll;
int main() {
    ll n;
    vector<ll> a(3);
    cin >> n >> a[0] >> a[1] >> a[2];
    sort(a.begin(), a.end());

    ll ans = n/a[0];
    if(a[1]%a[0]) ans += n/a[1] - n/(a[0]*a[1]);
    if(a[2]%a[0] && a[2]%a[1]) ans += n/a[2] - n/(a[2]*a[0]) - n/(a[2]*a[1]) + n/(a[0]*a[1]*a[2]);

    cout << ans << endl;
}