from functools import reduce
import itertools
n = int(input())
a, b, c = map(int, input().split())


def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


def lcm(a, b):
    return a*(b//gcd(a, b))


ans = 0
for k in range(1, 4):
    for subset in itertools.combinations((a, b, c), k):
        x = reduce(lcm, subset)
        ans += n//x*(-1)**(k-1)
print(ans)