def calc(x):
    re = x
    while x>0: 
        x //= 2
        re += x
    return re


def find(x) :
    l = 1
    r = 500000000000000050
    re = 0
    while(l <= r) :
        mid = (l+r)//2
        cc = (int)(calc(mid))
        if cc == x:
            return mid
        if cc < x:
            re = mid
            l = mid+1
        else:
            r = mid-1
    
    return re

def solve() :
    n = (int)(input())
    n-=1
    ans=1
    r=1
    q=1
    if(n==0) :
        print(1)
        return
    a = (int)(find(n))
    ans += (n-calc(a))*(a+1)
    while(a) :
        ans += q*r*((a+1)//2)*((a+1)//2)
        r *= 2 
        a //= 2
        q+=1

    print((int)(ans));

T = (int)(input())
while T :
    solve()
    T-=1