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

public class Solution {
    static int seive[];
    static int size = 1000000;
    static long longestSequence(long[] a) {
        //  Return the length of the longest possible sequence of moves.
        long sum = 0, seiv = 0;
        int i,j;
        for(i=0;i<a.length;i++)
        {
            if(a[i]<=(long)size)
                sum = sum+seive[(int)a[i]];
            else
            {
                seiv = 0;
               for(j=1;j<Math.sqrt(a[i]);j++)
               {
                   if(a[i]%j==0)
                       seiv = maxlong(seiv, seive[(int)j]*(a[i]/j)+1);
               }
                sum = sum+seiv;
            }
        }
        return sum;
    }
    static long maxlong(long a, long b)
    {
        if(a>b)
            return a;
        return b;
    }
    static int max(int a, int b)
    {
        if(a>b)
            return a;
        return b;
    }
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        seive = new int[size+1];
        int i,k;
        seive[1] = 1;
        for(i=1;i<=size;i++)
        {
            for(k=1;k*i<=size;k=k+1)
            {
                if(i==1 && k!=1)
                {
                    seive[k*i] = k+1;
                }
                else if(k!=1)
                {
                    seive[k*i] = max(seive[k*i], (k)*seive[i]+1);
                }
            }
        }
        //System.out.println("out");
        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();
    }
}