import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {
   static long singleStick(long x){
        if(x == 1){
             return 1;
        }
       if(x == 2){
           return 2;
       }
        //find the smallest divisor of a
        long sqrtx = (long)Math.floor(Math.sqrt(x));
        long divisor = 1;
        for(long i = 2; i<=sqrtx; i++){
            if(x % i == 0){
                long temp = i;
                divisor = x / temp;
                break;
            }
        }
       if(divisor == 1){
           return x + (x-1);
       }
        long divided = x / divisor;
        return divisor + divisor * singleStick(divided);
    }

    static long longestSequence(long[] a) {
       long sum = 0;
        for(long x: a){
            sum += singleStick(x);
        }
        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();
    }
}