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

long long int longestSequence(long long int a)
{
    if(a==2)
        return 3;
    if(a==1)
        return 1;
    long long int tmp=2;
    while(a%tmp==0 && a!=tmp)
        tmp+= 2;
    tmp-= 2;
    if(tmp==0)
        return (++a);
    return (1+(a/tmp)*longestSequence(tmp));
}

int main() {  
    int n;
    cin >> n;
  
    vector <long long> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
  
    /* Enter your code here. Print output to STDOUT */   
    long long int tot=0;
    for(long long int i=0;i<n;i++)
    {
        tot+= longestSequence(a[i]);
    }
    cout<<tot;
    return 0;
}