using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
class Solution {

    static long longestSequence(long[] a) {
        //  Return the length of the longest possible sequence of moves.
        
        long l = a.Length;
        long sum=0;
        long[] arr = new long[l];
           for(int i=0;i<a.Length;i++)
            {
               
                sum=a[i];
               
               while(a[i]!=0)
                {
                    sum+=a[i]/2;
                    a[i]=a[i]/2;
                }
                arr[i] = sum;
                sum=0;
                
                
            }
        Array.Sort(arr);
       long s = 0;
          for(int i=0;i<arr.Length;i++)
        {
           s+=arr[i];
        }
        return s;
    }

    static void Main(String[] args) {
        int n = Convert.ToInt32(Console.ReadLine());
        string[] a_temp = Console.ReadLine().Split(' ');
        long[] a = Array.ConvertAll(a_temp,Int64.Parse);
        long result = longestSequence(a);
        Console.WriteLine(result);
    }
}