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

public class Solution {

    static long longestSequence(long[] a,long n) {
        int i;
        long j;
        long c=0;
        for(i=0;i<n;i++)
        {
            c=c+a[i];
            j=2;
            while(a[i]>1&&j<=a[i])
            {
               if(a[i]%j==0)
               {
                a[i]=a[i]/j;
                c=c+a[i];j=2;
            }else
                   j++;
        }
    }return c;
    }

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