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 i,c;long r=0,c1;
        if(a==1)return 1;
        while(a>0)
        {//System.out.println(" "+a);
            if(a==1)return r+1;
            if(a%2==0){r+=a;a=a/2;continue;}
            else
            {c=0;
                for(i=3;i<=Math.sqrt(a);i++)
                {
                    if(a%i==0){r+=a;a/=i;c=1;break;}
                }
             if(c==0)return r+a+1;
            }
        }
        //System.out.println(" "+r);
        return r;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt(),i;
        long[] a = new long[n];
        for(i = 0; i < n; i++){
            a[i] = in.nextLong();
        }long result=0;
        for(i=0;i<n;i++)result += longestSequence(a[i]);
        System.out.println(result);
        in.close();
    }
}