def gcd(*numbers: int) -> int:
    if len(numbers) == 1:
        return numbers[0]
    if len(numbers) == 2:
        a, b = numbers
        if a < b:
            a, b = b, a

        while True:

            if a % b == 0:
                return b
            a, b = b, a % b

    first_gcd = gcd(*numbers[:2])
    return gcd(first_gcd, *numbers[2:])


def lcm(*numbers: int) -> int:
    if len(numbers) == 1:
        return numbers[0]
    if len(numbers) == 2:
        return numbers[0] * numbers[1] // gcd(*numbers)
    first_lcm = lcm(*numbers[:2])
    return lcm(first_lcm, *numbers[2:])


def main():
    N = int(input())
    a, b, c = map(int, input().split())

    print(N // a + N // b + N // c
          - N // lcm(a, b) - N // lcm(b, c) - N // lcm(c, a)
          + N // lcm(a, b, c))


if __name__ == "__main__":
    main()