#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

int main() {  
    long long int n,i,max=-1,k,j;
    cin >> n;
  
    vector <long long> a(n);
    for (i = 0; i < n; i++) {
        cin >> a[i];
        if(a[i]>max)
            max=a[i];
    }
  
    /* Enter your code here. Print output to STDOUT */   
    
    long long int aa[max+1]={0};
    aa[0]=0;
    aa[1]=1;
    aa[2]=3;
    for(i=3; i<=max; i++)
    {
        if(i%2!=0)
        {
            aa[i]=aa[i]+i;
        }
        else
        {
            k=i;
            j=(k/2)-1;
            for(; j>=0; j--)
            {
                while(j%2!=0)
                {
                    j--;
                }
                aa[i]=aa[i]+aa[k]+j+aa[j]+1;
                k=j;
            }
        }
    }
    for(i=0;i<n; i++)
    {
        cout<<aa[a[i]]<<endl;
    }
    return 0;
}