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

public class Solution {

    static long longestSequence(long[] a, int n) {
        //  Return the length of the longest possible sequence of moves.
        long moves = 0;
        for(int i = 0; i<n; i++){
            if(a[i] == 1){
                moves += 1;
                continue;
            }
            moves += a[i];
            while(a[i]%2==0){
                a[i] /= 2;
                moves += a[i];
            }
            int j = 3;
            for(; j<=Math.sqrt(a[i]); j += 2){
                while(a[i]%j==0){
                    a[i] /= j;
                    moves += a[i];
                }
            }
            if(j>Math.sqrt(a[i]))
                moves += 1;
        }
        return moves;
    }

    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, n);
        System.out.println(result);
        in.close();
    }
}