N = int(input())
s = list(map(int,input().split()))

def gcd(a,b):
	if(b == 0):return a
	return gcd(b,a%b)

f_a = N // s[0]
f_b = N // s[1]
f_c = N // s[2]
f_a_b = int(N //(s[0]*s[1]/gcd(s[0],s[1])))
f_b_c = int(N //(s[1]*s[2]/gcd(s[1],s[2])))
f_c_a = int(N //(s[2]*s[0]/gcd(s[2],s[0])))


p = int((s[0]*s[1])/gcd(s[0],s[1]))
q = int((p*s[2])/gcd(p,s[2]))

f_a_b_c = int(N // q)



print(f_a+f_b+f_c-f_a_b-f_b_c-f_c_a+f_a_b_c)