import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Sol {

    static long longestSequence(long[] a) {
        int n=a.length;
        long ans=0;
        for(int i=0;i<n;i++){
            long el=a[i];
            if(el==1){
                ans+=1;
                continue;
            }
            while(el%2==0){
                ans+=el;
                el=el/2;
            }
            if(isprime(el)){
                ans+=el;
            }
            else {
                for (int j = 3; j <=Math.sqrt(el)+1; j+=2) {
                    if (el%j==0){
                        ans=ans+(el);
                        el=el/j;
                        if(isprime(el)){
                            ans+=el;
                        }
                        j=1;

                    }
                }
            }
            ans+=1;
        }
        return ans;
    }

    private static boolean isprime(long n) {
        if(n==1)return false;
        if(n==2)
        return true;
        if(n==3)
        return true;
        if (n % 2 == 0)
        return false;
        if (n % 3 == 0)
        return false;

        int i = 5;
       int  w = 2;

        while (i * i <= n) {
            if (n % i == 0)
            return false;

            i += w;
            w = 6 - w;
        }
        return true;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        long[] a = new long[n];
        for(int a_i = 0; a_i < n; a_i++){
            a[a_i] = in.nextLong();
        }
        long result = longestSequence(a);
        System.out.println(result);
        in.close();
    }
}