/*

 * USER: Raj Manvar
 * LANG: C++
 *  */
#include <bits/stdc++.h>
#include <unistd.h>
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define DRT()  int t; cin>>t; while(t--)
#define TRACE
#ifdef TRACE
#define trace1(x)                cerr << #x << ": " << x << endl;
#define trace2(x, y)             cerr << #x << ": " << x << " | " << #y << ": " << y << endl;
#define trace3(x, y, z)          cerr << #x << ": " << x << " | " << #y << ": " << y << " | " << #z << ": " << z << endl;
#define trace4(a, b, c, d)       cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " << c << " | " << #d << ": " << d << endl;
#define trace5(a, b, c, d, e)    cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " << c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl;
#define trace6(a, b, c, d, e, f) cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " << c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " << #f << ": " << f << endl;
#else
#define trace1(x)
#define trace2(x, y)
#define trace3(x, y, z)
#define trace4(a, b, c, d)
#define trace5(a, b, c, d, e)
#define trace6(a, b, c, d, e, f)
#endif
using namespace std;
typedef long long int lli;

vector<bool> sie(1000006);
vector<lli> primes;

void sieve()
{
  fill(sie.begin(),sie.end(),0);
  sie[0]=1; sie[1]=1;
  for (lli i=2;i<sie.size();i++)
    {
      if (sie[i]==1)
        continue;
      for (lli j=i+i;j<sie.size();j+=i)
        sie[j]=1;
    }
  for (lli i=2;i<sie.size();i++)
    if (sie[i]==0)
      primes.push_back(i);

}

lli func(lli x)
{
  if (x==1)
    return 1;
  
  if (x==2)
    return 3;
  
  lli ans = 1;
  lli count = 1;

  vector<lli> prime_factorisation;
  
  for (int i=0;i<primes.size();i++)
    {
      while(x%primes[i]==0)
        {
          prime_factorisation.pb(primes[i]);
          x=x/primes[i];
        }
    }


  if (x!=1)
    prime_factorisation.push_back(x);

  for (int i=prime_factorisation.size()-1;i>=0;i--)
    {
      count*=prime_factorisation[i];
      ans+=count;
    }
  
  return ans;
}


int main()
{
  sieve();
  int n;
  cin>>n;
  lli ans = 0;
  for (int i=0;i<n;i++)
    {
      lli x;
      cin>>x;
      ans += func(x);
    }
  cout<<ans<<endl;
}