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

public class Solution {

    static long longestSequence(long[] a) {
        long max=0;
        int l=a.length;
        for(int i=0;i<l;i++)
        { 
            long x=tot(a[i]);
            //System.out.println(x);
            max+=x;
        }
        return max;
    }
    static long tot(long n)
    {
        long sum=n;
        if(n<2)
            return n;
        while(n>=2)
        { long x=1;
            if(n%2==0)
            {
                x=n/2;
                sum+=(n/2);
            }
            else
            {
                for(int i=3;i<=Math.sqrt(n);i++)
                {
                    if(n%i==0)
                    {
                        x=n/i;
                        break;
                    }
                }
                sum+=x;
            }
        // System.out.println(x);
            if(n==x)
            {
                
                break;
            }
            n=x;
        }
        return sum;
    }

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