#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{   int t;
    cin>>t;
    long long sum=0;
    while(t--) {
    long long n;
    cin>>n;
    long long a[1000];
    int count=0;
    while (n%2 == 0)
    {
        a[count++]=2;
        n = n/2;
    }
 
    for (int i = 3; i <= sqrt(n); i = i+2)
    {
        
        while (n%i == 0)
        {
            a[count++]=i;
            n = n/i;
        }
    }
    if (n > 2)
        a[count++]=n;
     long long moves=1;
    for(int i=0;i<count;i++){
        moves=moves*a[i]+1;
    }
    sum+=moves;
}
 cout<<sum<<endl;
    
    return 0;
}