#!/bin/python3

import sys

    
def longestSequence(a):
    c=0
    
    for i in range(len(a)):
        j=2
        c+=a[i]
        while(a[i]>1):
            if(a[i]%j==0):
                a[i]=a[i]//j
                c+=a[i]
            elif (a[i]==j):
                a[i]=0
            else:
                j+=1
                continue
            
    return c
if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = longestSequence(a)
    print(result)