def count_set_bits_fast(N, x):
    # 2^(x+1)の周期でビットが変化する
    cycle_length = 1 << (x + 1)
    
    # フルサイクルの数
    full_cycles = N // cycle_length
    count_in_full_cycles = full_cycles * (1 << x)
    
    # 残りの部分
    remaining = N % cycle_length
    count_in_remaining = max(0, remaining - (1 << x) + 1)
    
    return count_in_full_cycles + count_in_remaining

T = int(input())
for _ in range(T):
    N = int(input())
    ans = 0
    for i in range(60):
        result = count_set_bits_fast(N, i)
        ans += result
    print(ans)