import sys,random,bisect from collections import deque,defaultdict,Counter from heapq import heapify,heappop,heappush from itertools import cycle, permutations from math import log,gcd input = lambda :sys.stdin.readline().rstrip() mi = lambda :map(int,input().split()) li = lambda :list(mi()) memo = {} def calc(n): if n <= 1: return n if n in memo: return memo[n] if n&1 == 1: memo[n] = 1 + min(calc(n//2),calc((n+1)//2)) else: memo[n] = calc(n//2) return memo[n] A = [calc(i) for i in range(101)] def calc2(n): if n <= 1: return n if n&1: if (n//2) & 1: return 1 + calc2((n+1)//2) else: return 1 + calc2((n)//2) else: return calc2(n//2) memo3 = {} def calc3(n): if n in memo3: return memo3[n] if n <= 1: return n if n&1: if n%4 == 3: memo3[n] = 1 + calc3((n+1)//2) return 1 + calc3((n+1)//2) else: memo3[n] = 1 + calc3((n)//2) return 1 + calc3((n)//2) else: memo3[n] = calc3((n)//2) return calc3(n//2) memo = {} def f(n): if n in memo: return memo[n] """ sum calc(i) for i in 0...n """ q,r = (n+1)//4,(n+1)%4 res = 0 for i in range(r): res += calc3(4*q+i) """ sum calc(i) for i in 0123,4567,...,(4*q-4),(4*q-3),(4*q-2),(4*q-1) r 0: calc(0) + calc(4//2) + calc(8//2) + ... calc((4*q-4)//2) = calc(0) + calc(1) + calc(2) + ... calc(q-1) 1: calc(0) + calc(4//2) + calc(8//2) + ... calc((4*q-4)//2) = calc(0) + calc(1) + calc(2) + ... calc(q-1) + q 2: calc(2//2) + calc(6//2) + calc(10//2) + ... calc((4*q-2)//2) = calc(1) + calc(3) + calc(5) + ... calc(2*q-1) 3: calc(4//2) + calc(8//2) + ... calc((4*q)//2) = calc(1) + calc(2) + ... + calc(q) + q sum = f(q-1) + f(2*q-1) + f(q) """ if q!=0: res += f(q-1) + f(2*q-1) + f(q) + 2*q memo[n] = res return res for _ in range(int(input())): print(f(int(input())))