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

public class Solution {
 static int N=2000000;
    static ArrayList<Long> findDivisors(long n){
        ArrayList<Long> div=new ArrayList<>();
        for (long i=1; i<=(long)Math.sqrt(n); i++){
            if (n%i==0){
                if (n/i == i) div.add(i);
                else{
                    div.add(i);
                    div.add(n/i);
                }
            }
        }
        return div;
    }
    static long[] table;
    static long findseq(long a){
        if(a<N && table[(int)a]!=0) return table[(int)a];
        ArrayList<Long> div=findDivisors(a);
        long max=-1;
        if(div.size()==2){
          return (a<N)?table[(int)a]=a+1:a+1;  
        } 
        for(int i=2;i<div.size();i++){
            long val=((a/div.get(i))*findseq(div.get(i)))+1;
            if(max<val) max=val;
        }
        return (a<N)?table[(int)a]=max:max;
    }
    static long longestSequence(long[] a) {
        //  Return the length of the longest possible sequence of moves.
        long ans=0;
        for(int i=0;i<a.length;i++){
            ans+=findseq(a[i]);
        }
        return ans;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        long[] a = new long[n];
        long max=-1;
        for(int a_i = 0; a_i < n; a_i++){
            a[a_i] = in.nextLong();
            if(max<a[a_i]) max=a[a_i];
        }
        table=new long[N];
        table[1]=1;
        table[2]=3;
        table[3]=4;
        table[4]=7;
        table[5]=6;
        //System.out.print(table[0]);
        long result = longestSequence(a);
        System.out.println(result);
        in.close();
    }
}