#solve atcoder problem
#exec({'RUBY_THREAD_VM_STACK_SIZE'=>'100000000'},'/usr/bin/ruby', $0) if !ENV['RUBY_THREAD_VM_STACK_SIZE']
#memo: (1..n).each do |d|
require 'prime'
require 'matrix'

def k2(k)
  return 1 if(k == 0)
  return $n if(k == 1)
  ans = 1
  if((k%2) == 0)
    ans *= k2(k/2)**2
  else
    ans *= k2(k-1)
    ans *= $n
  end
  return ans % $m
end

def k2b(n,k,m=1_000_000_007) $n=n;$m=m; return k2(k) end

def inpf() a=gets.chomp.split(" ").map(&:to_f)end

def inps() a=gets.chomp.split(" ")end

def copy(a) Marshal.load(Marshal.dump(a)) end

def kaijo(n,r = 10**9+7)(n < 2)? 1 : (2..n).inject{|memo,u|memo=(memo*u)%r} end

def na(n,d=0) Array.new(n,d)end

def na2(n,m,d=0) Array.new(n){Array.new(m,d)}end

def na3(n,m,l,d=0) Array.new(n){Array.new(m){Array.new(l,d)}}end

def inp() a=gets.chomp.split(" ").map(&:to_i)end

def r_up(a, b) (a+b-1)/b end

t = gets.to_i
t.times do
  n = gets.to_i
  ans = 0
  w = n.to_s(2).length
  i = w -1
  s = 0
  while(i >= 0)
    ans += (2**(i))*(i+2*s)/2 if(n[i] == 1)
    s += 1 if(n[i] == 1)
    i -= 1
  end
  puts ans+s
end
=begin
7 0
3 7 5 2 10 3 20

=end