#!/bin/python

import sys


def divisores(a):
    div = []
    num = 2
    while num <= a:
        while a % num == 0:
            div.append(num)
            a /= num
        num += 1      
    return div
    

def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    moves = long(0)
    
    while len(a) > 0:
        data = a.pop(0)
        
        #print data
        if data == 1:
            moves += 1
        else:
            div = divisores (data)
            temp1 = 1
            temp2 = 1
            for i in range(len(div)):
                temp1 = temp1 * div[i] + 1
                temp2 = temp2 * div[-(i+1)] +1

            if temp1 >= temp2:
                moves += temp1
            else:
                moves += temp2
        
    return moves
if __name__ == "__main__":
    n = int(raw_input().strip())
    a = map(long, raw_input().strip().split(' '))
    result = longestSequence(a)
    print result