#include <cstdio>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
using namespace std;
int T, a[105], num, now1, now2, ans;
int main() {
    int T;
    long long n;
    scanf("%d", &T);
    while (T--) {
        scanf("%I64d",&n);
        memset(a, 0, sizeof(a));
        ans = num = 0;
        while (n) {
            ++num;
            a[num] = n % 2; 
            n /= 2;
        }
        now1 = 1;
        while (now1 <= num) {
            now2 = now1;
            while (now2 <= num && a[now2] == 0) ++now2;
            ++ans;
            while (now2 <=num && a[now2] == 1) ++now2;
            now1 = now2;
        }
        printf("%d\n",ans);
    }
    return 0;
}