#!/bin/python3

import sys
import math

def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    moves = 0
    for x in a:
        moves += break_chocolate(x,0)
        
    return moves
        
def break_chocolate(number,moves):
    if(number == 1):
        return moves+number
    if(number % 2 == 0):
        for x in range(2,int(math.sqrt(number)+1)):
            if(number % x == 0):
                moves+=number
                return break_chocolate(int(number/x),moves)
    else:
        for x in range(3,int(math.sqrt(number)+1),2):
            if(number % x == 0):
                moves+=number
                return break_chocolate(int(number/x),moves)        
    
    moves+=number
    return break_chocolate(int(number/number),moves)
        
if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = longestSequence(a)
    print(result)