#!/bin/python3

import sys
def primeFact(num,tmpSum):
    newSum=tmpSum
    for i in range(2,int(num**0.5)+1):
        while num%i==0:
            num=num//i
            newSum+=num
    if not(num==1):
        newSum=newSum+1
    return newSum

def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    mySum=0
    for i in a:
        tmpSum=i
        newSum=primeFact(i,tmpSum)#[j for j in range(2,int(i**0.5)+1) while i%j==0]
        mySum+=newSum
    return mySum        
if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = longestSequence(a)
    print(result)