import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution {
static int checkPrime(int p)
{
int count=0;
for(int l=2;l<p;l++)
{if (p%l==0)
{count=1;break;}
}
if (count==0){
return(1);}
else {
return(0);
}}
static long longestSequence(long[] a) {
int flag,m=0;long n,moves=0;
for(int i=0;i<a.length;i++)
{
flag=0;
for(int j=2;j<a[i];j++)
{
if(a[i]%j==0)
{
flag=1;
break;
}
}
if(flag==0)
{moves+=a[i]+1;}
else
{
for(int k=2;k<a[i];k++)
{
m=checkPrime(k);
if(m==1&&a[i]%k==0)
{n=a[i]/k;
moves+=(n+1);moves+=(n*k);
}}}}
return(moves);}
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();
}
}