import java.io.*;
import java.math.BigInteger;
import java.util.*;
 
 
class TestClass{
	
	private static boolean isComposite[];
	private static int primes[];
		
	public static void main(String[] args) throws Exception{
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		BufferedWriter bw=new BufferedWriter(new OutputStreamWriter(System.out));
		int n=Integer.parseInt(br.readLine());
		StringTokenizer st=new StringTokenizer(br.readLine());
		long arr[]=new long[n];
		for(int i=0;i<n;i++)
			arr[i]=Long.parseLong(st.nextToken());
		isComposite=new boolean[1000001];
		int primecount=0;
		for(int i=2;i<isComposite.length;i++)
		{
			if(!isComposite[i])
			{
				primecount++;
				for(int j=i<<1;j<isComposite.length;j=j+i)
					isComposite[j]=true;
			}
		}
		primes=new int[primecount];
		int index=0;
		for(int i=2;i<isComposite.length;i++)
		{
			if(!isComposite[i])
				primes[index++]=i;
		}
		long var=0,ans=0;
		long mult=0;
		LinkedList<Long> list;
		ListIterator<Long> itr;
		for(int i=0;i<n;i++)
		{
			if(arr[i]==1)
			{
				ans+=1;
				continue;
			}
			mult=1;
			list=getPrimeFactors(arr[i]);
			itr=list.listIterator();
			while(itr.hasNext())
			{
				var=itr.next();
				ans+=mult;
				mult*=var;
			}
			ans+=arr[i];
		}
		
		bw.write(Long.toString(ans));
		bw.flush();
		bw.close();
		br.close();

	}
	
	private static LinkedList<Long> getPrimeFactors(long num)
	{
		LinkedList<Long> list=new LinkedList<Long>();
		long sqrt=(int)Math.sqrt(num);
		int index=0;
		while(num!=1&&index<primes.length&&primes[index]<=sqrt)
		{
			if(num%primes[index]==0)
			{
				list.addFirst((long)primes[index]);
				num=num/primes[index];
				sqrt=(long)Math.sqrt(num);
			}
			else
				index++;
		}
		list.addFirst(num);
		return list;
	}
}