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

public class Solution {
    static long no_of_moves(long x){
        long size=1l;
        long move=x;
        boolean f=false;
        while(size!=x){
            long i=2l;
            f=false;
            while( i <= (long)Math.sqrt(x)){
                if(x%(i*size)==0){
                    f=true;
                    break;
                }
                i++;
            }
            if(f){
                size=i*size;
                move+=x/size;
                //System.out.println(move);
            }
            else{
                size=x;
                move+=x/size;
            }
        }
        //System.out.println(move);
        return move;
    }

    static long longestSequence(long[] a,int n) {
        //  Return the length of the longest possible sequence of moves.
        long result=0;
        for(int i=0;i<n;i++){
            result+=no_of_moves(a[i]);
        }
        return result;
    }

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