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.
        int n = a.length;
        long total  = 0;
        long subtotal  = 0;
        long num, temp;
        for(int i = 0; i < n; i++ ){            
            num = a[i];
            subtotal = num;            
            if(num != 1)
                while(true){                    
                    temp = findDivisor(num);
                    if(temp == -1){
                        subtotal += 1;
                        break;
                    }
                    else{
                        num = temp;
                        subtotal += temp;
                    }
                } 
            total +=subtotal;
        }
        return total;
    }
    
    static long findDivisor(long a){   
        //if(a % 2 == 0) return a / 2;         
        for(int i =2; i <= Math.sqrt(a); i++){
            if(a%i == 0)
                return a/i;
        }
        return -1;
    }
    

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