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

public class Solution {

    static long longestSequence(long[] a, int n) {
        long sum = 0;
        long tsum =0;
        for(int i=0;i<n;i++){            
            tsum =0;
            long ta = a[i];
            tsum = tsum + ta;
             for(int j= (int)Math.sqrt(ta); j>1 ;j--){                 
                 if(ta%j == 0){                                                               
                    //System.out.println("tsum : "+tsum);
                    ta = ta/j; 
                    tsum = tsum + ta;
                 } 
                 else{
                     tsum = ta;
                 }
              }
            if(a[i] != 1) sum += tsum+1;
            else sum += tsum;
            //System.out.println("sum : "+sum);
        }                       
        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,n);
        System.out.println(result);
        in.close();
    }
}