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 sum = 0;
        for (long i : a){
            sum += compute(i);
        }
        return sum;
    }
    
    static long compute(long a){
        long ret = 0;
        long cur = 3;
        while(a > 0){
            ret += a;
            if (a == 1){
                break;
            }
            if (a % 2 == 0){
                a /= 2;
            }else{
                long upperBound = (long) Math.sqrt(a);
                while(cur <= upperBound){
                    if (a % cur == 0){
                        a /= cur;
                        break;
                    }else{
                        cur += 2;
                    }
                }
                if (cur > upperBound) a = 1;
                cur = 3;
            }
        }
        return ret;
    }

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