import java.io.*; import java.util.*; import java.text.*; import java.math.*; import java.util.regex.*; public class Solution { static long longestSequence(long[] a) { long result = 0; for (int i = 0; i < a.length; i++) { while (a[i] % 2 == 0) { result += a[i]; a[i] /= 2; } for( int j = 3; j <= a[i]; j += 2) { while (a[i] % j == 0) { result += a[i]; a[i] /= j; } } if (a[i] == 1) result++; } return result; // Return the length of the longest possible sequence of 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); System.out.println(result); in.close(); } }