#include <iostream>
using namespace std;
const int N = 1e5 + 10;
int n;
int a[N];
int main()
{
cin >> n;
for (int i = 0; i < n; i ++ )
{
cin >> a[i];
int cnt = 0;
while (a[i]) //a[i]不为0,就一直右移一位
{
if (a[i] & 1) cnt ++ ; //判断最末位是否为1
a[i] >>= 1;
}
cout << cnt << ' ';
}
return 0;
}