#include<bits/stdc++.h>
using namespace std;
int t,a[101],f[101],ma,c; long long x;
int main(){
    scanf("%d",&t);
    while(t--){
        scanf("%lld",&x);
        memset(a,0,sizeof(a));
        memset(f,0,sizeof(f));
        ma=c=0;
        while(x) a[c++]=x%2,x/=2;
        for(int i=0;i<c;i++){
            if(a[i]) f[i]=f[i-1]+1;
            else f[i]=f[i-1];
            ma=max(ma,f[i]);
        }
        printf("%d\n",ma);
    }
    return 0;
}