#include <bits/stdc++.h>

using namespace std;
bool isPrime(int num) {
    if (num <= 3) {
        return num > 1;
    } else if (num % 2 == 0 || num % 3 == 0) {
        return false;
    } else {
        for (int i = 5; i * i <= num; i += 6) {
            if (num % i == 0 || num % (i + 2) == 0) {
                return false;
            }
        }
        return true;
    }
}

long longestSequence(vector <long> a,int n) {
  long ans=0;
  for(int i=0;i<n;i++){
      long sol=a[i];
      if(a[i]==1){
          ans += 1;
      }
      else if(isPrime(a[i])){
          ans += a[i]+1;
      }
      else{
          long num = a[i];
          long number = a[i];
          int j=2;
          while(num != 1){
              if(num%j == 0){
                  num = num/j ;
                  sol += num;
                  
              }
              else{
                  j++;
              }
          }
          ans += sol;
      }

  }
    return ans;
}

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