/**
 * Created by Prateek on 12/15/2017.
 */
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class BreakingStick {
    static ArrayList<Long> factors(long x){
        ArrayList<Long> list = new ArrayList<>();
        for(long i=1;i<=x/2;i++){
            if(x%i==0){
                list.add(i);
            }
        }
        Collections.sort(list);
        return list;
    }
    static long longestSequence(long[] a) {
        long sum=0;
        for(int i=0;i<a.length;i++){
            long num = a[i];
            ArrayList<Long> tlist = factors(num);
            for(int j=0;j<tlist.size();j++){
                if(j%2==0){
                    sum = sum+tlist.get(j);
                }
            }
            sum = sum+num;
        }
        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();
    }
}