import math from itertools import combinations N = int(input()) S = list(set(map(int, input().split()))) ans = 0 # 包除原理 for i in range(1, len(S) + 1): for c in combinations(S, i): g = math.lcm(*c) v = N // g if i % 2 == 1: ans += v else: ans -= v print(ans)