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

#define int           long long 
#define S             second
#define F             first
#define pb            push_back
#define all(c)        (c).begin(),(c).end()
#define rall(c)       (c).rbegin(),(c).rend() 
#define lb            lower_bound
#define si(c)         (int)((c).size())
#define lcm(a, b)      (a * (b / __gcd(a,b)))  
#define inf           (int)(1e18)
#define endl          '\n'
#define mp            make_pair
#define time(s)       (double(clock()-s)/double(CLOCKS_PER_SEC))
#define debug(args...)    _F(#args, args)
#define vi            std::vector<int>
#define pii           pair<int, int> 
#define vpi           vector<pii>

clock_t start;
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());

template<typename T> void _F(const char *name, T arg1){ cerr << name << " = " << arg1 << endl;}
template<typename T, typename... Args> void _F(const char *names, T arg1, Args... args)
{ const char *name = strchr(names, ',');cerr.write(names, name-names) << " = " << arg1 << endl;_F(name+2, args...);}

template< typename T1, typename T2 > istream& operator>>(istream& in, pair<T1, T2> &q){ in >> q.F >> q.S; return in;}
template< typename T1, typename T2 > ostream& operator<<(ostream& out, pair<T1, T2> &q){ out << q.F << " " << q.S; return out;}
template< typename T1, typename T2 > pair<T1, T2> operator+(pair<T1, T2> p1, pair<T1, T2> p2){ return {p1.F+p2.F, p1.S+p2.S};}
template< typename T1, typename T2 > pair<T1, T2> operator-(pair<T1, T2> p1, pair<T1, T2> p2){ return {p1.F-p2.F, p1.S-p2.S};}
template< typename T1, typename T2 > bool operator<(pair<T1, T2> p1, pair<T1, T2> p2){ return p1 < p2 ;}

template<typename T> void Unique(vector<T> &v){
    sort(all(v)), v.resize(distance(v.begin(), unique(all(v))));
}

int fun(int x) {
    if(x == 0)return 0;
    return 1+fun(x%__builtin_popcountll(x));
}


void solve(int &test) {
    int n;
    cin >> n;
    string s;
    cin >> s;
    int one = 0;
    for(int i = 0; i < n; i++) {
        one += (s[i] == '1');
    }
    if(one == 0) {
        for(int i = 0; i < n; i++) {
            cout << 1 << endl;
        }
        return;
    }
    if(one == 1) {
        for(int i = 0; i < n; i++) {
            if(s[i] == '1') {
                cout << 0 << endl;
            } else if(i != n-1){
                if(s[n-1] == '1') {
                    cout << 2 << endl;
                } else {
                    cout << 1 << endl;
                }
            } else {
                cout << 2 << endl;
            }
        }
        return;
    }
    vi ans[3];
    for(int d = one-1; d <= one+1; d++) {
        if(d == one)continue;
        int pw[n], tot = 0, cur = 1;
        for(int i = n-1; i >= 0; i--) {
            cur %= d;
            if(s[i] == '1'){
                tot += cur;
            }
            tot %= d;
            pw[n-i-1] = cur;
            cur *= 2;
        }
        for(int i = 0; i < n; i++) {
            if(s[i] == '1') {
                ans[d-one+1].pb((tot-pw[n-i-1]+d)%d);
            } else {
                ans[d-one+1].pb((tot+pw[n-i-1]+d)%d);
            }
        }
    }
    for(int i = 0; i < n; i++) {
        if(s[i] == '1'){
            cout << fun(ans[0][i])+1 << endl;
        } else {
            cout << fun(ans[2][i])+1 << endl;
        }
    }
}

signed main(){

    ios_base::sync_with_stdio(0); 
    cin.tie(0); cout.tie(0);   
    start = clock(); 

  

    int t = 1;
    // cin >> t;

    cout << fixed << setprecision(2);
     
    for(int i = 1; i <= t; ++i){
        solve(i); 
    }

    cerr << time(start);
    return 0;
}

Measured memory_bytes: 9724