#!/bin/python3

import sys
def ifprime(n):
    x=n
    for i in range(2,int(n/2)):
        if(x%i==0):
            return 0
    return 1

    
def longestSequence(a):
    sum=0
    for i in a:
        if(i==1):
            sum+=1
        elif(ifprime(i)):
            sum=i+1
        else:
            x=i
            sum=x+1
            for j in range(i,0,-1):
                if(x%j==0 and ifprime(j)):
                    sum+=j
                    x/=j
                    if(ifprime(x)):
                        break
                    print(sum)
    return(sum)

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