#!/bin/python3

import sys


import math
def listPrimeFact(num):
    facts = []
    while (num%2 ==0):
        facts.append(2)
        num = num //2

    for i in range(3,int(math.sqrt(num))+1,2):

        while num%i ==0:
            facts.append(i)
            num = num//i

    if num > 2:
        facts.append(num)
    return facts


def findSeq(num):
    fact = listPrimeFact(num)
    fact.sort(reverse=True)


    sum = 0
    mult =1
    for i in fact:
        mult =mult * i
        
        sum = sum + mult

    #print(sum+1)
    return(sum+1)



def longestSequence(a):
    sum = 0
    for i in a:
        sum += findSeq(i)
    
    return sum
    
    #  Return the length of the longest possible sequence of moves.

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