// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x) cout << #x << " = " << (x) << endl;
#define fs first
#define sc second
#define pb push_back
#define eb emplace_back
#define SP << " " <<

typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
typedef vector<int> vec;
typedef vector<P> pvec;
typedef vector<vector<int>> vvec;
typedef vector<vector<P>> pvvec;
typedef priority_queue<int> PQI;
typedef priority_queue<P> PQP;
typedef priority_queue<int,vector<int>,greater<int>> PQIG;
typedef priority_queue<P,vector<P>,greater<P>> PQPG;

const vector<int> DX = {0, -1, 0, 1, 1, 1, -1, -1};
const vector<int> DY = {1, 0, -1, 0, 1, -1, 1, -1};
constexpr int MOD = (1000000007);
// const int MOD = (998244353);
// const int INF = (1 << 30); // 1073741824
const ll INF = (1LL << 60); // 1152921504606846976
const double PI = (3.141592653589794);
const double EPS = (0.0000000001); // 10^(-10)

template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return 1;} return 0;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return 1;} return 0;}
template<class T> inline T ceil(T a, T b) {return T((a + b - 1) / b);}
template<class T> inline T round(T a, T b) {return T(a / b);}
template< typename T1, typename T2 > istream &operator>>(istream &is, pair< T1, T2 > &p) { is >> p.first >> p.second; return is; }
template <class T> inline void out(T &a) { bool flag=true; for(auto&x:a){if(flag) {flag=false;} else{ cout << ' '; } cout<<x; } cout << endl; }



//----------------------------------------------------------------
int nmax=200000+100; // 2*(10^5)
vvec G(nmax);





void solve4ts()
{
    
    
    int n;
    cin>>n;
    vec a(n);
    int bnow=0;

    rep(i,n){
        char x; cin>>x;
        a[i]=(x-'0');
        if(a[i]==1) bnow++;
    }
    
    vec m(nmax);
    rep(i,nmax){
        if(i==0){
            m[0]=0;
            continue;
        }
        int memo=i;
        int cnt=0;
        rep(j,20){
            if(memo%2==1) cnt++;
            memo/=2;
        }
        // memoがbitcount
        int idx=i%cnt;
        m[i]=m[idx]+1;
    }

    // rep(i,30){
    //     cout<<i<<" "<<m[i]<<endl;
    // }

    int x=0,y=0;
    int xm=1,ym=1;
    for(int i=n-1;i>=0;i--){
        if(a[i]==1){
            x+=xm;
            y+=ym;
            x%=(bnow+1);
            if(bnow-1>0){
                y%=(bnow-1);
            }
        }
        xm=(xm*2)%(bnow+1);
        if(bnow-1>0){
            ym=(ym*2)%(bnow-1);
        }
    }

    xm=1;
    ym=1;
    vec ans;
    for(int i=n-1;i>=0;i--){
        int memo;
        if(a[i]==0){
            memo=(x+xm+(bnow+1))%(bnow+1);
            ans.pb(m[memo]+1);
        }
        else{
            if(bnow-1>0){
                memo=(y-ym+(bnow-1))%(bnow-1);
                ans.pb(m[memo]+1);
            }
            else{
                ans.pb(0LL);
            }
        }
        xm=(xm*2)%(bnow+1);
        if(bnow-1>0){
            ym=(ym*2)%(bnow-1);
        }
    }

    reverse(all(ans));
    out(ans);

}
//-----------------------------------------------------------------

signed main(){ ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(15);
    int repeat = 1;
    // cin >> repeat;
    while(repeat--) solve4ts();
}

Measured memory_bytes: 13148