#include <iostream>
#include <algorithm>
#include <utility>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <math.h>
#include <string.h>
#include <iomanip>
#include <numeric>
#include <cstdlib>
#include <cstdint>
#include <cmath>
#include <functional>
#include <limits>
#include <cassert>
#include <bitset>

using namespace std;

/* template */

using ll = long long;

void debug_out() { std::cout << std::endl; }
 
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cout << H << " ";
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cout << "debug: "; debug_out(__VA_ARGS__)
#else
#define debug(...) 
#endif

#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)
#define rrep(i, a, n) for (int i = ((int)(n-1)); i >= (int)(a); i--)
#define Rep(i, a, n) for (long long i = (long long)(a); i< (long long)(n); i++)
#define RRep(i, a, n) for (long long i = ((long long)(n-1ll)); i>=(long long)(a); i--)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()

template <typename T>
std::ostream& operator<<(std::ostream& os, std::vector<T> vec) {
  for (std::size_t i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");
  return os;
}

struct Edge{
    int to;
    ll weight;
    Edge(int t, ll w) : to(t), weight(w){ }
};

struct edge{
    int from;
    int to;
    ll weight;
    edge(int f,int t,ll w) : from(f), to(t), weight(w){ }
};


using Graph = vector<vector<Edge>>;
using graph = vector<vector<int>>;
using edges = vector<edge>;

template <class T>
inline bool chmin(T &a, T b){
    if (a > b){
        a = b;
        return true;
    }
    return false;
}

template <class T>
inline bool chmax(T &a, T b){
    if (a < b){
        a = b;
        return true;
    }
    return false;
}

template <class T>
T lcm(T a, T b){
    return (a*b)/gcd(a,b);
}

ll ctoi(char c) {
	switch (c) {
	case '0': return 0; case '1': return 1; case '2': return 2;
	case '3': return 3; case '4': return 4; case '5': return 5;
	case '6': return 6; case '7': return 7; case '8': return 8;
	case '9': return 9;  default: return 0;
	}
}

constexpr ll LNF = 1LL<<50;

constexpr int INF = 1e9+7;

const long double PI=3.14159265358979323846;


vector<int> dx = {1,0,-1,1,-1,0};
vector<int> dy = {1,1,1,0,0,-1};

/* template */

ll mod_pow(ll x, ll n, ll mod){
    ll res = 1;
    while(n>0){
        if(n&1) res = res *x%mod;
        x = x*x%mod;
        n>>=1;
    }
    return res;
}

ll Pow(ll x, ll n){
    ll res = 1;
    while(n>0){
        if(n&1) res = res *x;
        x = x*x;
        n>>=1;
    }
    return res;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n; string s; cin >> n >> s;
    ll x = 0ll;
    ll y = 0ll;
    ll mod = 0;
    rep(i,0,n){
        if(s[i]=='1'){
            mod++;
        }
    }
    rep(i,0,n){
        if(s[i]=='1'){
            x += mod_pow(2,(n-i-1),mod+1);
            if(mod-1>0){
                y += mod_pow(2,(n-i-1),mod-1);
                y %= (mod-1ll);
            }
            x %= (mod+1ll);
        }
    }
    rep(i,0,n){
        ll ans = 1;
        ll p;
        if(mod-1==0 && s[i]=='1'){
            cout << 0 << endl;
            continue;
        }
        if(s[i]=='1'){
            p = y;
            p -= mod_pow(2,n-i-1,mod-1);
            p += 2*(mod-1);
            p %= (mod-1);
        }
        else{
            p = x;
            p += mod_pow(2,n-i-1,mod+1);
            p %= (mod+1);
        }
        while(p>0){
            ll mod1 = 0ll;
            for(ll j=1; j<=p; j *= 2ll){
                if(p & j){
                    mod1++;
                }
            }
            p %= mod1;
            ans++;
        }
        cout << ans << endl;
    }
}

Measured memory_bytes: 3736