import java.util.HashMap; import java.util.Map; import java.util.Scanner; /** * @author Sergey Skrobotov */ public class Solution { static final Map map = new HashMap<>(); static long solve(long n) { if (n == 1) { return 1; } if (map.containsKey(n)) { return map.get(n); } long res; for (long i = 2; i * i <= n; i++) { if (n % i == 0) { res = n + solve(n / i); map.put(n, res); return res; } } res = n + 1; map.put(n, res); return res; } static long longestSequence(long[] a) { // Return the length of the longest possible sequence of moves. long res = 0; for (long n: a) { res += solve(n); } return res; } 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(); } }