#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#define ll long long 
using namespace std;

bool prime[10000003] = {0};

/*ll rec(int a){
    if(a == 1)
        return 1;
    for(int i = (int)sqrt(a); i > 1; --i){
        if(!prime[i]){
            return (1 + i*rec(a/i));
        }
    }    
    return 1 + a*rec(1);
}*/

int main() {  
    int n;
    cin >> n;
  
    vector <long long> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    
    /*int i = 2;
    while(i < 1000003){
        for(int j = 2; i*j < 1000003; ++j){
            prime[i*j] = true;
        }
        while(prime[i++]){}
    }*/
    
    ll r = 0;
    for(int i = 0; i < n; ++i){
        vector<ll> prout;
        ll j = 2;
        ll aux = a[i];
        while(aux > 1 and j <= sqrt(a[i])){
            if(!(aux%j)){
                prout.push_back(j);
                aux /= j;
            }
            else{
                ++j;
            }
        }
        if(aux != 1){
            prout.push_back(aux);
        }
        ll s = 1;
        for(auto it = prout.begin(); it != prout.end(); ++it){
            cerr << *it << endl;
            s = 1 + *it * s;
        }
        r += s;
    }
    cout << r << endl;
    return 0;
}