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

public class Solution {

    static long longestSequence(long[] a) {
        int k=0;
        
        long j;
        long sum=0;
        long val=0;
        long fact[]=new long[50];
        long div[]=new long[50];
      
        
        for(int i=0;i<a.length;i++)
        {
           
          val=a[i];
            j=val/2;
            while(j>=2){
                if(val%j==0){
                    fact[k]=j;
                }
                j--;
                 k++;   
            }
            for(int x=0;x<fact.length;x++)
            {
                if(fact[x]!=0)
                div[x]=val/fact[x];
            }
             for(int y=0;y<div.length;y++){
                 if(y!=0 && y%2!=0){
                     sum+=div[y];
                 }
             }
            
           sum+=val+1; 
            
        }
        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();
    }
}