#include<bits/stdc++.h>
using namespace std;
long long int s=0;
long long int prime(long long int n,long long int n2)
{
  long long int i;
    while (n%2 == 0)
    {
        s+=n2;
        n2/=2;
        n = n/2;
    }
    for (i = 3; i <= sqrt(n); i = i+2)
    {
        while (n%i == 0)
        {
            s+=n2;
            n2/=i;
            n = n/i;
        }
    }
    if (n > 2)
        {
          s+=n2;
          n2/=n;
        }
    return n2;
}
int main()
{
  long long int i;
  int t;
  cin>>t;
  while(t--)
  {
    long long int n,n2;
    cin>>n;
    n2=n;
    n2=prime(n,n2);
    s+=n2;
  }
  cout<<s<<endl;
  return 0;
}