#include <bits/stdc++.h>

using namespace std;

long longestSequence(vector <long> a, int i) {
    //  Return the length of the longest possible sequence of moves.
    int y,h,x=0,flag=0;
    int z=a[i];
    if(a[i]==1)
    {
        x=0;
        goto finalpoint;
    }
   for(int j=2; j<=a[i]/2; ++j)
    {
        // condition for nonprime number
        if(a[i]%j==0)
        {
            flag=1;
            break;
        }
    }

    if (flag==0)
    {
        x=1;
    }
   do
   {
       if(a[i]%2==0)
       {
           y=a[i]/2;
           x=x+y;
           a[i]=a[i]/2;
       }
   } while(a[i]!=1 && (a[i]%2)==0);
    do
   {
       if(a[i]%3==0)
       {
           h=a[i]/3;
           x=x+h;
           a[i]=a[i]/3;
       }
   } while(a[i]!=1 && (a[i]%3)==0);
    finalpoint:
    return x+z;
}

int main() {
    int n;
    cin >> n;
    long result=0;
    vector<long> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    for (int i=0;i<n;i++)
    {
    result += longestSequence(a, i);
    }
    cout << result << endl;
    return 0;
}