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 i,j;
        long sum=0,devided;
        for (i=0; i<a.length;i++) {
            devided=a[i];
            while (devided%2==0) {
                sum+=devided;
                devided/=2;
            }
            if (devided==1) sum+=devided;
            else {
                j=3;
                while (j<=Math.sqrt(devided)) {
                    while (devided%j==0) {
                        sum+=devided;
                        devided/=j;
                    }
                    j+=2;
                }
                if (devided==1) sum+=devided;
                else sum+=devided+1;
            }
        }
        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();
    }
}