import math

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

n = int(input())
a = list(map(int, input().split()))
m = len(a)

ans = 0
for i in range(1, 1<<m):
    x = 1
    for j in range(m):
        if (i>>j) & 1:
            x = lcm(x, a[j])
    k = 1 if bin(i).count('1') % 2 == 1 else -1
    ans += k * (n // x)
print(ans)