# -*- coding: utf-8 -*-

def gcd(a,b):
    A = max(a,b)
    B = min(a,b)
    r = B
    while r>0:
        r = A % B
        if r == 0:
            break
        A = B
        B = r
    return B

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

ab_lcm = a*b//gcd(a,b)
bc_lcm = b*c//gcd(b,c)
ca_lcm = c*a//gcd(c,a)
abc_lcm = ab_lcm*c//gcd(ab_lcm,c)

a_num = N//a
b_num = N//b
c_num = N//c
ab_num = N//ab_lcm
bc_num = N//bc_lcm
ca_num = N//ca_lcm
abc_num = N//abc_lcm

print(a_num + b_num + c_num - ab_num - bc_num - ca_num + abc_num)