#!/bin/python3

import sys


def count(arr, val):
	if val < 2:
		return val
	total = 0
	while (val > 1):
		for x in arr:
			if val % x == 0:
				if val == x:
					total += val+1
					val = 1
				else:
					total += val
					val = val // x
				break
	return total

def longestSequence(b):
	a = [0 for _ in range(0, 1000001)]
	a[1] = 1
	a[2] = 0
	for x in range(2, 1000001):
		if a[x] == 0:
			for j in range(x*2, 1000001, x):
				a[j] = 1

	c = []
	for x in range(2, 1000001):
		if a[x] == 0:
			c.append(x)

	total = 0
	for x in b:
		total += count(c, x)
	return total


if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = longestSequence(a)
    print(result)