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

public class Solution {
    static long factor(long n){
        for(int i=3;i<=Math.sqrt(n);i+=2){
            if(n%i==0) return i;
        }
        if(n>2) return n;
        return 0;
    }
    static long longestSequence(long[] a) {
        long complet=0;
        for(int j=0;j<a.length;j++){
            long sum=0;long f=0;long n=a[j];
            while(n>1){
                if(n%2==0){sum+=n;n/=2;}
                else if(n%3==0){sum+=n;n/=3;}
                else{
                    if(f!=0&&n%f==0){sum+=n;n/=f;}
                    else{
                        f=factor(n);
                        sum+=n;n/=f;
                    }
                }
            }
            //System.out.println(sum+1);
            complet+=sum+1;
        }
        return complet;
    }

    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);
        System.out.println(result);
        in.close();
    }
}