#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define yn(ans) cout<<(ans?"Yes":"No")<<endl
#define YN(ans) cout<<(ans?"YES":"NO")<<endl
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
//入力系
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
//出力系
void print(const int& a){printf("%d",a);}
void print(const long long& a){printf("%lld",a);}
void print(const double& a){printf("%.15lf",a);}
template<class T> void print(const T& a){cout<<a;}
template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(const T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}
//デバッグ系
template<class T> void dprint(const T& a){cerr<<a;}
template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<endl;}
template<class T> void debug(const T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }

int main(){
    int n;
    string s;
    in(n,s);
    int one=0;
    rep(i,n){
        if(s[i]=='1')one++;
    }
    ll amari1=0,amari2=0;
    rep(i,n){
        if(s[i]=='1'){
            if(one!=0){
                amari1+=modpow(2,n-1-i,one+1);
                amari1%=one+1;
            }
            if(one!=2&&one!=1){
                amari2+=modpow(2,n-1-i,one-1);
                amari2%=one-1;
            }
        }
    }
    ll a;
    int ans;
    rep(i,n){
        ans=0;
        if(s[i]=='0'){
            if(one==0){
                ans=1;
            }else{
                ans++;
                a=amari1+modpow(2,n-1-i,one+1);
                a%=one+1;
                while(a!=0){
                    ans++;
                    bitset<64> bit(a);
                    if(bit.count()==1)break;
                    a%=bit.count();
                }
            }
        }else{
            if(one==1){
                ans=0;
            }else if(one==2){
                ans=1;
            }else{
                ans++;
                a=amari2-modpow(2,n-1-i,one-1);
                a%=one-1;
                if(a<0)a+=one-1;
                while(a!=0){
                    ans++;
                    bitset<64> bit(a);
                    if(bit.count()==1)break;
                    a%=bit.count();
                }
            }
        }
        out(ans);
    }
}


Measured memory_bytes: 3912