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

int n;
long long int arr[105];
long long int dp[105];

int findmax(int value){
   if(value==1)
        return 1;
    if(dp[value]!=-1)
        return dp[value];
    int m=0;
    for(int i=1;i<=value/2;i++){
        if(value%i==0){
            m = max(m,(value/i)*findmax(i));
        }
    }
    dp[value] = m+1;
    return dp[value];
}

int main() {  
    cin>>n;
    for(int i=0;i<105;i++){
        dp[i]=-1;
    }
    for(int i=1;i<=n;i++){
        cin>>arr[i];
    }
    int sum=0;
    for(int i=1;i<=n;i++)
        sum+=findmax(arr[i]);
    cout << sum;
}