t = int(input().strip())
n=[]
for a0 in range(t):
    n.append(int(input().strip())) 

for i in range(t):
   fib =[1,2]
   j=0
   sum =2
    
   while(fib[j+1] < n[i]):
    if((fib[j] + fib[j+1]) < n[i]):
     fib.append(fib[j] + fib[j+1])
     
     if((fib[j] + fib[j+1])%2 == 0):
      sum = sum + fib[j] + fib[j+1] 

     j+=1   
   
    else:
      break
 
   if(n[i] > 2):
     print(sum)

def fibo(n:int):
    s=1
    p=0
    t=p
    # su=0
    while s+t<n:
        p=s
        s=s+t
        t=p
        
        if s%2==0:
            yield s
            
    
for _ in range(int(input())):
    n=int(input())
    s=(sum(fibo(n)))
    print(s)

void sol(){
    long long int n, ans = 2, i = 2; cin >> n;
    vector<long long int> dp;
    dp.push_back(1), dp.push_back(2);
    while(dp[i - 1] < n){
        dp.push_back(dp[i - 1] + dp[i - 2]);
        if(dp[i]%2 == 0) ans += dp[i];
        i++;
    }
    if(dp[i - 1]%2 == 0) ans -= dp[i - 1];
    cout << ans << endl;
}
int main(){
    int t;
    cin >> t;
    while(t--) sol();
    return 0;
}

int main(){
    int t; 
    scanf("%d",&t);
    for(int a0 = 0; a0 < t; a0++){
        long long int n, sum =0, fib[100]; 
        scanf("%lld",&n);
        fib[0] = 0;
        fib[1] = 1;
        
        for(long int i = 2; i < 100; i++)
        {
           fib[i] = fib[i-1] + fib[i-2];
                if((fib[i] <= n) && (fib[i] % 2 == 0))
                {
                    sum += fib[i];
                }
                if(fib[i] >= n)
                {
                    i = n;
                } 
            
        }
        printf("%lld\n", sum);
        
    }
    return 0;
}

for a0 in range(t):
    n = int(input().strip())
    l=[0,2]
    s=0
    while l[-1]<n:
        temp=4*l[-1]+l[-2]
        l.append(temp)
    print(sum(l[:-1]))