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

public class Solution {

    static long longestSequence(long[] a) {
        //  Return the length of the longest possible sequence of moves.
        int length = a.length;
        long moves = 0;
        for(int i =0; i< length; i++) {
            if(a[i] == 1)
                moves += 1;
            else
                moves += a[i] + fun(a[i],2);
        }
        return moves;
    }
    
    static long fun(long x, long f) {
        long temp = f;
        long var = (long)Math.sqrt(x);
        while(temp <= var) {
            if(x%temp == 0)
                return (x/temp + fun(x/temp,temp));
            temp++;
        }
        return 1;
    }

    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();
    }
}