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.
        long max = 0;
        for(int i=0;i<a.length; i++) {
            long original = a[i];
            while(a[i] !=1) {
                long temp = 0;
                if(a[i] % 2 == 0) {
                    temp = a[i] / 2;
                    a[i] = a[i] / 2;
                }else {
                    long multiple = smallestOdd(a[i]);
                    temp = a[i] / multiple;
                    a[i] = a[i] / multiple;
                    if(multiple == 1) {
                        a[i] =1;
                    }
                    
                }
                long temp2=0;
                
                for(int x=1;x<original; x++) {
                    if((x*temp) == original ) {
                        temp2 = x;
                        break;
                    }
                }
                
                max +=temp2;
            }
            max +=original;
            
        }
        
        
        return max;
    }
    
    static long smallestOdd(long x) {
        
        long s = 1;
        
        for(int i=2; i<x; i++) {
            if(x%i == 0){
                s = i;
                break;
            }
        }
        
        return s;
    }
    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();
    }
}