def solve():
    N = int(input())

    res = 0
    for i in range(1, 60):
        d, m = divmod(N+1, 2 ** i)

        res += d * (2**(i-1))
        res += max(0, m - 2**(i-1))

    return res


T = int(input())
for i in range(T):
    ans = solve()
    print(ans)