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

public class Solution {

    static long longestSequence(long[] a) 
    {
        long sum=0;
        for(int i=0;i<a.length;i++)
        {
            long num=a[i];
            long res=num;
            if(num!=1)
            {
                while(true)
                {
                        int j=1;
                        while(num>1)
                        {
                            j++;
                            if(num%j==0)
                            {
                                num=num/j;
                                res=res+num;
                                j=1;
                            }
                        }      
                        break;
                }
            }
            sum=sum+res;
        }
        return sum;
    }
   /* public static boolean isPrime(long num)
    {
        int c=0;
        for(int i=1;i<=num/2;i++)
        {
            if(num%i==0)
                c++;
        }
        if(c==1 )
            return true;
        else
            return false;
    }*/
    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();
    }
}