#a, b, cがすべて異なるとき: 3つの集合の和集合
#n(AorBorC) = n(A)+n(B)+n(C)-n(A&B)-n(B&C)-n(C&A)+n(A&B&C)
######## !!注意!! n(A&B):AとBの「最小公倍数」の倍数の数

from fractions import gcd

def lcm(numbers):
    return reduce(lambda x, y: (x*y)/gcd(x,y), numbers, 1)
   
N = input()
a, b, c = map(int, raw_input().split())
na = N/a
nb = N/b
nc = N/c
nab = N/lcm([a, b])
nbc = N/lcm([b, c])
nca = N/lcm([c, a])
nabc = N/lcm([a, b, c])
print na+nb+nc-nab-nbc-nca+nabc