#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define el "\n" 
#define fio ios_base::sync_with_stdio(false),cin.tie(NULL)
#define ull unsigned long long int
#define ld long double
#define F first  
#define S second 
#define PB push_back 
#define MP make_pair
#define LB lower_bound//pass (a,a+n,key)
#define UB upper_bound
#define vi vector<int>  
#define pi pair<int,int> 
//rotate array d times using--> rotate(a,a+d,a+n);
//reverse array of d elements using--> reverse(a,a+d);
const long double PI = atan(1.0)*4.0;
const ll M = 1000000007;
const ll INF = 1e18;
const ll E=1e-9;
ll smldivsr(ll n)
{
    int g=0,j;
    for (ll i=2; i<=sqrt(n) && g==0; i++)
    {
        if(n%i==0)
           {
               g=1;
               j=i;
           }
    }
    return j;
} 
bool isprime(ll n)
{
    for(ll i=2;i*i<=n;i++)
    {
        if(n%i==0)
            return false;
    }
    return true;
}
bool iseql(ld n,ld m)
{
      if(abs(n-m)<E)
            return true;
        else
            return true;
}
 
ll fact(ll n)
{
    ll fact = 1;
    for (int i=1;i<=n;i++)
        fact = ((fact)%M*i)%M;
    return fact;
} 
void divsr(int n)
{
    for (int i=1; i<=sqrt(n); i++)
    {
           if (n%i==0)
            {
               if (n/i == i)
                 cout<<i<<" ";
                  
               else
               cout<<i<<" "<<n/i<<" ";
                  
            }
     }
}

 
int main()
{
  fio;
  int n;cin>>n;
  ll a,s,q=0;  
  for(int i=0;i<n;i++)
  {
      cin>>a;
      s=a;
    
      while(a!=1)
      {
        if(isprime(a))
         {
           s=s+1;
           a=1; 
         }
         else if(a%2==0)
         {
             a=a/2;
             s=s+a;
         }
         else
         {
             a=a/smldivsr(a);
             s=s+a;
             
         } 
      }
    
      q=q+s;
  } 
    cout<<q<<el;
}