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

public class Solution {
    static int maxdp=0;
    static long longestSequence(long[] a) {
        long out=0;
        long []dp=new long[maxdp+1];
        dp[0]=0;
        dp[1]=1;
        
        for(int i=2;i<maxdp+1;i++){
            for(int j=1;i*j<maxdp+1;j++){
                dp[i*j]=Math.max(i*dp[j]+1,dp[i*j]);
            }
        }
        for(long i:a){
            out+=dp[(int)i];
        }
        return out;
    }
    
    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();
            maxdp=Math.max(maxdp,(int)a[a_i]);
        }
        long result = longestSequence(a);
        System.out.println(result);
        in.close();
    }
}