#include<iostream>
#include<vector>
#include<cmath>
using namespace std;
const int maxN = 1e5+5;
long mList[maxN];
int main()
{
int n;
int sum=0;
cin>>n;
for(int i=0;i<n;i++) cin>>mList[i];
for(int i=0;i<n;i++) {
int bitN = floor(log2(mList[i]))+1;
sum = 0;
for(int k=0;k<=bitN;k++){
sum += (mList[i]>>k&1);
}
cout<<sum;
if(i!=n-1) cout<<" ";
}
return 0;
}