import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from functools import reduce
from bisect import bisect_left, insort_left
from heapq import heapify, heappush, heappop

INPUT = lambda: sys.stdin.readline().rstrip()
INT = lambda: int(INPUT())
MAP = lambda: map(int, INPUT().split())
S_MAP = lambda: map(str, INPUT().split())
LIST = lambda: list(map(int, INPUT().split()))
S_LIST = lambda: list(map(str, INPUT().split()))

sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7


def main():
    N = INT()
    a, b, c = MAP()

    lcm_base = lambda x, y: (x * y) // gcd(x, y)
    lcm = lambda *numbers: reduce(lcm_base, numbers, 1)

    ab, bc, ca, abc = lcm_base(a, b), lcm_base(b, c), lcm_base(c, a), lcm(a, b, c)
    print(N//a + N//b + N//c - N//ab - N//bc - N//ca + N//abc)


if __name__ == '__main__':
    main()