#!/bin/python3

import sys
def sequence(n):
    sm = n
    while(n!=1):
        div = 2
        while(n%div!=0):
            div += 1
        n = n//div
        sm += n
    return(sm)

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

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