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

public class Solution {

    static long longestSequence(long[] a) {
        //  Return the length of the longest possible sequence of moves.
        for(int arr_i=0;arr_i<a.length;arr_i++){
            
            long n=a[arr_i];
            long k=1,i=n/2;
            long m;
            long count=0;
            while(n>1){
                
                if(n%i==0){
                    
                    count=count+i;
                    n=i;
                    k=a[arr_i]/i;
                    i=n/2;
                }
                else{
                    i--;
                }
            }
//            return count;
             a[arr_i]+=count;
        }
        long sum=0;
        for(int r=0;r<a.length;r++){
            sum+=a[r];
        }
        return sum;
    }

    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();
    }
}