#include <bits/stdc++.h>
#include<math.h>
using namespace std;

long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
return 0;
}

int main() {
    int n,i,sum=0,x,k,max=0,j;
    bool flag=true;
    cin >> n;
    int arr[n];
    if(n>=1 && n<=100)
    {
        for(i=0;i<n;i++)
        {
            cin>>x;
            if(x>=1 && x<=pow(10,12))
            {
                arr[i]=x;//length of sticks
            }
            else
            {
                flag=false;
                break;
            }
        }
        
        if(flag==true)
        {
            for(i=0;i<n;i++)//n sticks
            {
                x=arr[i];
                if(x==1)
                {
                    sum=sum+1;
                }
                else
                {
                
                    for(k=2;k<=(x/2);k++)//for factors
                    {
                        if(x%k==0)
                        {
                            max=k;
                        }
                    }
                
                    for(j=max;j>=2;)
                    {
                        if(x%j==0)
                        {
                            sum=sum+j;
                            j=j/2;
                        }
                    }
                    sum=sum+arr[i]+1;
                }
             }         
            cout<<sum;
        }
       
    }
    
    return 0;
}