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

public class Solution {
    static long prime(long p){
        int q=0;
        for(int i=1;i<=p;i++){
            if((p%i)==0){
                q++;
            }
        }
        if(q==2){
            return 1;
        }
        else{
            return 0;
        }
    }
    static long odd(long r){
        long y = 0;
        for(int i=1;i<=r;i++){
            if((r%i)==0){
                y = y + i;    
            }
        }
        return y;
    }
    static long even (long r){
        long kj = 0;
        while(r>0){
            kj += r;
            r = r/2;
            if(r%2!=0){
                r =r-1;
                kj++;
            }
        }
        return kj;
    }
    static long longestSequence(long[] a) {
        long sum = 0;
        for(int i=0;i<a.length;i++){
            if(prime(a[i])==1){
         
                sum += (a[i]+1);
                     //  System.out.println("000 "+sum);
            }
            else{
                if(a[i]%2!=0){
                    sum += odd(a[i]);
                   // System.out.println("--"+odd(a[i]));
                }
                else{
                    sum += even(a[i]);
                }
        }
           // System.out.println(sum);
        }    
        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();
    }
}