def f(n):
    if n<=1: return n
    i = n.bit_length()-1; m = 1<<i
    return (n^m)+1+i*(m>>1)+f(n-m)
for _ in range(int(input())): print(f(int(input())))