#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);i++)

ll lcm(ll d1, ll d2){
	return d1 / __gcd(d1, d2) * d2;
}

int main(void){
	ll n, a, b, c;
	cin >> n >> a >> b >> c;
	ll ua = n / a;
	ll ub = n / b;
	ll uc = n / c;
	ll uab = n / lcm(a, b);
	ll ubc = n / lcm(b, c);
	ll uca = n / lcm(c, a);
	ll uabc = n / lcm(a, lcm(b, c));
	printf("%lld\n", ua + ub + uc - uab - ubc - uca + uabc);
	return 0;
}