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

public class Solution {
    public static boolean isPrime(long num){
        if(num==0 || num==1) return false;
        for(long i=2;i<=Math.sqrt(num)+1;i++){
            if(num%i==0){
                return false;
            }
        }
        return true;
    }
    static long longestSequence(long[] a) {
      long total=0;
        for(int i=0;i<a.length;i++){
          long num=a[i];
            total+=1;
            long x=num;
            while(x>=1){
            boolean flag =isPrime(x);
            if(flag==true){
                total+=num;
                break;
            }
            else if(x%2==0){
                if(x==2){
                  x=x/2;
               }
                else{
                long value=1;
                long j=0;
                long data=x;
                while(data%2==0  && value!=x/2){
                   j++;
                    value*=2;
                   data=data/2;
                }
                total+=num/value;
                 
                j=(j==1)?(j+1):j;
                 x=x/j;
                }
               
            }
            else{
                if(x==1) {
                    total+=num;
                    x=0;
                }
                for(int j=2;j<x/2;j++){
                    if(x%j==0){
                        total+=x/j;
                        x=j;
                        break;
                    }
                }
            }
            }
      }
        return total;
    }

    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((a.length==1)?result:result-1);
        in.close();
    }
}