// yukicoder: No.316 もっと刺激的なFizzBuzzをください
// 2019.5.4 bal4u

#include <stdio.h>

int a[3], sz;

int gcd(int a, int b)
{
	int r;
	while (b != 0) r = a % b, a = b, b = r;
	return a;
}

long long lcm(int a, int b)
{
	return (long long)a/gcd(a, b)*b;
}

int main()
{
	int i, N, t, ans;
	scanf("%d", &N);
	scanf("%d", a), sz = 1;
	for (i = 1; i < 3; i++) {
		scanf("%d", a+sz);
		if (a[sz] != a[sz-1]) sz++;
	}
	if (sz == 1) ans = N/a[0];
	else if (sz == 2) ans = N/a[0] + N/a[1] - N/lcm(a[0], a[1]);
	else ans = N/a[0] + N/a[1] + N/a[2] - 
		(N/(t = lcm(a[0], a[1])) + N/lcm(a[1], a[2]) + N/lcm(a[0], a[2])) +
		N/lcm(t, a[2]);
	printf("%d\n", ans);
	return 0;
}