n = int(input())

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

def lcm(a,b):
	return a*b/gcd(a,b)

a,b,c = map(int,raw_input().split())

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