#include <bits/stdc++.h>

using namespace std;

long longestSequence(long a[],int n) 
{
    //  Return the length of the longest possible sequence of moves.
    long sum=0;
    int i;
    for(i=0;i<n;i++)
    {
         int s=1,h=a[i];
        while(a[i]!=0)
        {
           
            int x=a[i]%2;
            if(a[i]==6)
                a[i]/=3;
            else
             a[i]/=2;
            
            if(x==0)
                s+=h/a[i];           
           
           
        }
        sum+=s;
    }
    return sum;
    
}

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