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

public class Solution {
    static boolean isPrime(long n) {
        if (n%2==0) return false;
        for(long i=3;i*i<=n;i+=2) {
            if(n%i==0)
                return false;
        }
        return true;
    }
    static long find(long n){
        long d=2;
        while(d<n){
            if(n%d==0)
                return d;
            else
                d++;
        }
        return 2;
    }
    static long moves(long n){
        if(n==1)
            return 1;
        else if(n==2)
            return 3;
        else if(isPrime(n))
            return (n+1);
        else{
           long d=find(n);
           return n+moves(n/d);
        }
    }
    static long longestSequence(long[] a) {
        long ans=0;
        for(int i=0;i<a.length;i++){
            ans=ans+moves(a[i]);
        }
        return ans;
    }

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