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 resultDivisor = 0;
        for (long l : a) {
            resultDivisor = resultDivisor + findDivisor(l);
        }
        return resultDivisor;

    }

    static long findDivisor(long longNumber) {
        long divisor = longNumber;
        while (longNumber > 1) {
            if (longNumber % 2 == 0) {
                divisor = divisor + longNumber / 2;
                longNumber = longNumber / 2;
            } else {
                long longI = 3;
                while (longNumber > 1) {
                    if (longNumber % longI == 0) {
                        divisor = divisor + longNumber / longI;
                        longNumber = longNumber / longI;
                    } else longI++;
                }
            }
        }
        return divisor;
    }

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