/*#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

int main() {  
    int n;
    cin >> n;
  
    vector <long long> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
   

    /* Enter y
 
    return 0;
*/

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 int main()
 {
 	ll t;
 	cin >> t;
 	ll res=0;
 	while(t--)
 	{
 		ll n;
 		cin >> n;
 		if(n==1){
 			res+=1;
 			continue;
 		}
 		res += (1+n);
 		for(ll i=2; i*i<=n; i++)
 		{
 			if(n%i == 0)
 			{
 				res += (n/i);
 				n/=i;
 				i=1;
 			}
 		}
 	}
 	cout << res;
 	return 0;
 }