#!/bin/python3

import sys

def longestSequence(a):
    l=[]
    for j in range(len(a)):
        s=0;x=a[j];ctr=1
        if x==1:
            l.append(1)
            continue
        while True:
            for i in range(2,x+1):
                if x%i==0:
                    s+=ctr
                    ctr=x//i;x=i
                    break
            if ctr==1:
                s+=a[j];
                l.append(s)
                break
    return sum(l)
            

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