import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

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

    

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        long[] a = new long[n];
        for(int a_i = 0; a_i < n; a_i++){
            a[a_i] = in.nextLong();
        }
        long result = longestSequence(a);
        System.out.println(result);
        in.close();
    }
}