#include <bits/stdc++.h>
using namespace std;
#define MAX 1000005
#define  ll long long int
#define FOR(i,a,n) for(ll i=(a);i<(n);i++)

long longestSequence(vector <ll> a) {
    vector<int> p(1000001,1);
    FOR(i,2,sqrt(1000001))
    {
      if(p[i])
      {
          for(ll j = i*i;j<1000001;j+=i)
          {
              p[j] = 0;
          }
      }
 
    }
    vector<int> v;
    FOR(i,2,1000001)
    {
        if(p[i]) v.push_back(i);
    }
    ll ans = 0;
    FOR(i,0,a.size())
    {
      vector<ll> h;
      h.push_back(1);
      ll x = 1,r = a[i];
      FOR(j,0,v.size())
      {
        while(r%v[j] == 0) 
        {
          x*=v[j];
          h.push_back(x);
          r/=v[j];
        }
      }
      if(r > 1) h.push_back(r*x);
      ll sum = 0;
      FOR(j,0,h.size())
      {
        sum+= a[i]/h[j];
      }
      ans+= sum;
    }

    return ans;
}


int main() {
    int n;
    cin >> n;
    vector<ll> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    long result = longestSequence(a);
    cout << result << endl;
    return 0;
}