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

long long evenException(long long num){
    return num|(num-1);
}

long long getDivisor(long long num, long long exp){
    while(exp){
        if(num%exp == 0) return exp;
        exp >>= 1;
    }
    return 0;
}

long long getLog(long long num){
    long long result = 1;
    while(num){
        num >>= 1;
        result <<= 1;
    }
    
    return (result>>1);
}

int main() {  
    int n;
    cin >> n;
  
    //cout<<evenException(getDivisor(n,getLog(n)));
    
    vector <long long> a(n);
    long long finalResult = 0;
    
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        
        int num = a[i];
        int result = 1;
        
        if(num==1) result += 1;
        
        while(num>1){
            if(num%2==0){
                long long log = getLog(num);
                long long y = getDivisor(num, log);
                //cout<<"found the divisor = "<<y<<endl;
                if(y){
                    result = result * evenException(y) * (num/y);
                    break;
                }
            }
            long long  y = num/2;
            long long r;
            for(r=y; r>=1; --r){
                if(num%r==0) break;
            }
            result = result * (num/r);
            //cout<<num<<" = "<<result<<endl;
            num = r;
        }
        finalResult += result;
    }
    
    cout<<finalResult+1<<endl;
    
    return 0;
}