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) {
        //  Return the length of the longest possible sequence of moves.
        long result = 0;


        for(int i=0; i<n; i++){
            List<Long> arr = new ArrayList<Long>();

            for(long j=1;j<=a[i];j++){
                if (a[i]%j==0){
                    arr.add(j);
                }
            }

            Long paths[] = new Long[arr.size()];
            arr.toArray(paths);
            for(int x=0; x<arr.size(); x++){
                if(x%2 == 0){
                    result = result + paths[x];
                }
            }
            
            if(result != 1){
                result = result + a[i];
            }
            

        }

        return result;

    }

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