#!/bin/python3

import sys
import math

def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    result = 0
    for i in a:
        part = i
        while( i % 2 == 0):
            i = i // 2
            part = part + i
        for j in range(3,int(math.sqrt(i))+1,2):
            while( i % j == 0):
                i = i // j
                part = part + i
        if( i > 2):
            part = part + 1
        result = result + part
    return result

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