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

public class Solution {

    static int longestSequence(int[] a,int max) {
        //  Return the length of the longest possible sequence of moves.
        int arr[]=new int[max+1];
        arr[1]=arr[0]=1;
        arr[2]=3;
       // arr[3]=4;
        int sum=0;
        //System.out.println(max);
        for(int i=0;i<a.length;i++){
            if(arr[a[i]]!=0)
                sum=sum+arr[i];
            else
                sum=sum+calFactorsValue(arr,a[i]);
        }
        return sum;
    }
    
    
    static int calFactorsValue(int[] arr,int n){//calulating the factors of n and providing the moves value
        int sum=0;                                //in this n -->factors
       // System.out.println("coming at beg "+n);
        for(int i=0;i<arr.length;i++){
            //System.out.print(arr[i]+" ");
        }
        for(int i=1;i<(int)(Math.sqrt(n)+1);i++){        //if(arr[factor]!=0)return arr[factor]  
            if(n%i==0){                           //other wise calucate t
                if(n/i==i){
                   if(arr[i]!=0){
                        sum=Math.max(sum,(n/i*arr[i]));
                      // System.out.println("coming at lower1 value i ="+ i+" sum is  "+sum);
                   }
                    else
                        sum=Math.max(sum,(n/i*calFactorsValue(arr,i))); 
                }
                else{
                    
                    if(arr[i]!=0){
                       sum=Math.max(sum,(n/i*arr[i]));
                       // System.out.println("coming at lower1 value i ="+ i+" sum is  "+sum);
                    }
                    else{
                        //System.out.println("coming at lower2");
                        sum=Math.max(sum,((n/(n/i))*calFactorsValue(arr,i)));
                        //System.out.println("coming at lower2 value i ="+ n/i+" sum is  "+sum);
                    }
                    if(n/i!=n){
                    if(arr[n/i]!=0){
                        sum=Math.max(sum,(n/(n/i)*arr[n/i]));
                       //System.out.println("coming at lower3 value i ="+ n/i+" sum is  "+sum);

                    }
                    else{
                       // System.out.println("coming at lower4");
                        sum=Math.max(sum,((n/(n/i))*calFactorsValue(arr,n/i)));
                        //System.out.println("coming at lower4 value i ="+ n/i+" sum is  "+sum);
                    }
                  }
                }
            }
        }
        //System.out.println("coming at lower value of sum is  "+sum);
        arr[n]=sum+1;
         for(int i=0;i<arr.length;i++){
            //System.out.print(arr[i]+" ");
        }
        
        return sum+1;
    }
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int[] a = new int[n];
        int max=Integer.MIN_VALUE;
        for(int a_i = 0; a_i < n; a_i++){
            a[a_i] = in.nextInt();
            if(a[a_i]>max)
                max=a[a_i];
        }
        int result = longestSequence(a,max);
        System.out.println(result);
        in.close();
    }
}