#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(a) for(int i=0;i<a;i++)
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rloop(i,b,a) for(int i=b;i>a;i--)
#define pans(a) cout<<a<<endl
#define fr() freopen("input.txt", "r", stdin)
#define fr2() freopen("ouput.txt", "w", stdout)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
const int mod=1e9+7;

/* for taking input faster than scanf  */
inline int sc() { int ip = getchar_unlocked(), ret = 0, flag = 1;
for (;ip<'0' || ip>'9';ip = getchar_unlocked())
if (ip == '-')
{ flag = -1;ip = getchar_unlocked();break; }
for (;ip >= '0'&&ip <= '9';ip = getchar_unlocked())ret = ret * 10 + ip - '0';
return flag*ret; }

long long find_biggest_factor(long long x){
  if(x<=2)
    return 1;
  bool isPrime = true;
  for(int i=2;i<=sqrt(x)+1;i++){
    if(x%i==0){
      isPrime = false;
      return x/i;
    }
  }

  return 1;
}
int main()
{
	long long ans = 0;
	int test; test=sc(); while(test--)
	{
		long long n; cin>>n;
		ans += n;
		while(n>1){
		n = find_biggest_factor(n);
		ans += n;
		}
		
	}
	cout<<ans;
return 0;
}