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 result = 0L;
        
        for(long value : a) {
            long tempLength = value;
            long tempResult = 1L;
            if(value%3==0) {
                tempResult += 3;
                tempLength = tempLength/3;
                boolean isValid = false;
                while(tempLength>1 && !isValid) {
                    if(tempLength%2==0) {
                        tempResult += value/(tempLength/2);
                        tempLength = tempLength/2;
                    } else if(tempLength%1==0) {
                        tempLength = 1;
                        isValid = true;
                    } 
                }
            } else{
                if(value>1)
                    tempResult += value;
            }
            result += tempResult;
        }
        return result;
    }

    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();
    }
}