from itertools import combinations
from math import lcm


def f(n: int, vs: list[int]) -> int:
    res = 0
    for i in range(1, len(vs)+1):
        for cs in combinations(vs, i):
            x = 1
            for c in cs:
                x = lcm(x, c)

            sgn = 1 if i % 2 == 1 else -1
            res += sgn * (n // x)

    return res


N = int(input())
A, B, C = map(int, input().split())

ans = f(N, [A, B, C])
print(ans)