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

N = int(input())
A = [int(input()) for i in range(N)]
g = A[0]
for a in A:
    g = gcd(g, a)
ans = sum(a // g for a in A)
print(ans)