#define CPP17
#include <limits>
#include <initializer_list>
#include <utility>
#include <bitset>
#include <tuple>
#include <type_traits>
#include <functional>
#include <string>
#include <array>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iterator>
#include <algorithm>
#include <complex>
#include <random>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <regex>
#include <cassert>
#include <cstddef>
#ifdef CPP17
#include <variant>
#endif

#define endl codeforces

#define ALL(v) std::begin(v), std::end(v)
#define ALLR(v) std::rbegin(v), std::rend(v)

using ll = std::int64_t;
using ull = std::uint64_t;
using pii = std::pair<int, int>;
using tii = std::tuple<int, int, int>;
using pll = std::pair<ll, ll>;
using tll = std::tuple<ll, ll, ll>;
using size_type = ssize_t;
template <typename T> using vec = std::vector<T>;
template <typename T> using vvec = vec<vec<T>>;

template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }

template <typename T, std::size_t Head, std::size_t... Tail> 
struct multi_dim_array { using type = std::array<typename multi_dim_array<T, Tail...>::type, Head>; };

template <typename T, std::size_t Head> 
struct multi_dim_array<T, Head> { using type = std::array<T, Head>; };

template <typename T, std::size_t... Args> using mdarray = typename multi_dim_array<T, Args...>::type;

#ifdef CPP17
template <typename T, typename F, typename... Args> 
void fill_seq(T &t, F f, Args... args) { 
    if constexpr (std::is_invocable<F, Args...>::value) { 
        t = f(args...); 
    } else { 
        for (size_type i = 0; i < t.size(); i++) fill_seq(t[i], f, args..., i); 
    } 
}
#endif

template <typename T> vec<T> make_v(size_type sz) { return vec<T>(sz); }

template <typename T, typename... Tail> 
auto make_v(size_type hs, Tail&&... ts) { 
    auto v = std::move(make_v<T>(std::forward<Tail>(ts)...)); 
    return vec<decltype(v)>(hs, v); 
}

namespace init__ { 
struct InitIO { 
    InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } 
} init_io; 
}
#define CPP17


namespace utility {

template <typename T>
using validate_integer = typename std::enable_if<std::is_integral<T>::value, ll>::type;

template <typename T>
auto popcount(T n) -> validate_integer<T> {
    return __builtin_popcountll(n);
}

// 0 indexed
template <typename T>
auto msb(T n) -> validate_integer<T> {
    return 64 - __builtin_clzll(n) - 1;
}

template <typename T>
constexpr auto ceil_pow2(T s) -> validate_integer<T> {
    ll ret = 1;
    while (ret < s) ret *= 2;
    return ret;
}

}

vec<ll> solve() {
    ll n;
    std::string s;
    std::cin >> n >> s;
    ll psum = 0;
    for (char c : s) if (c == '1') psum++;

    auto mods = make_v<ll>(3, n);
    for (ll i = 0; i < 3; i++) {
        ll mod = psum + (i - 1), cur = 1;
        if (mod <= 0) continue;
        for (ll j = 0; j < n; j++) {
            mods[i][j] = cur % mod;
            cur = cur * 2 % mod;
        }
    }

    vec<ll> sumv(3);
    for (ll i = 0; i < 3; i++) {
        std::reverse(ALL(mods[i]));
        ll m = psum + (i - 1);
        if (m <= 0) continue;
        for (ll j = 0; j < n; j++) if (s[j] == '1') (sumv[i] += mods[i][j]) %= m;
    }


    vec<ll> memo(n * 2 + 10);
    memo[0] = 0; memo[1] = 1; memo[2] = 1;
    for (ll i = 3; i < memo.size(); i++) {
        ll cnt = utility::popcount(i);
        ll nxt = i % cnt;
        memo[i] = memo[nxt] + 1;
    }
    
    vec<ll> ret(n);
    for (ll i = 0; i < n; i++) {
        bool ok = true;
        if (s[i] == '1' && psum == 1) {
            ret[i] = 0;
            continue;
        }

        ll sum = 0;
        if (s[i] == '0') {
            ll m = psum + 1;
            sum = sumv[2];
            sum += mods[2][i];
            sum %= m;
        } else {
            ll m = psum - 1;
            sum = sumv[0];
            sum += m - mods[0][i];
            sum %= m;
        }

        ret[i] = memo[sum] + 1;
    }

    return ret;
}


int main() {
    auto ans = solve();
    for (ll e : ans) std::cout << e << "\n";
    return 0;
}


Measured memory_bytes: 12860