#include <iostream>
#ifdef MBP
#include "stdc++.h"
#else
#include <bits/stdc++.h>
#endif

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define REP(i, n) for (long long int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (long long int i = 1, i##_len = (n); i <= i##_len; ++i)
#define REP_R(i, n) for (long long int i = (n - 1); i >= 0; --i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((long long int)(x).size())
#define BIT(n) (1LL << (n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());

//#define DEBUG

#ifdef DEBUG
#define OUT(x) std::cout << (x) << std::endl
#define OUT2(x, y) std::cout << (x) << "," << (y) << std::endl
#define OUT3(x, y, z) std::cout << (x) << "," << (y) << "," << (z) << std::endl
#define OUTSP(x) std::cout << (x) << " ";
#define OUTLF std::cout << std::endl
#define OUTPA(p) OUT2(p.first, p.second)
#else
#define OUT(x) NULL
#define OUT2(x, y) NULL
#define OUT3(x, y, z) NULL
#define OUTPA(p) NULL
#define OUTSP(p) NULL
#define OUTLF NULL
#endif

#define INF INT_MAX
#define INFLL LLONG_MAX
#define PB push_back
#define MOD 1000000007LL

#define LSB(x) __builtin_ctzll(x)
#define MSB(x) 64LL - __builtin_clzll(x) - 1LL
#define MSBINT(x) 32LL - __builtin_clz(x)
#define BITCNT(x) __builtin_popcountll(x)

using namespace std;
using uif = uint_fast64_t;
using ll = long long int;
using vec = vector<ll>;
using mat = vector<vector<ll>>;
using pa = pair<ll, ll>;
using tTree = __gnu_pbds::tree<ll, __gnu_pbds::null_type, less<ll>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>;

template <class T>
inline void input(T &arr)
{
  ll n = arr.size();
  REP(i, n)
  cin >> arr[i];
}
template <class T>
inline void input2(T &arr1, T &arr2)
{
  ll n = arr1.size();
  REP(i, n)
  cin >> arr1[i] >> arr2[i];
}
template <class T>
inline void inputPA(T &arr)
{
  ll n = arr.size();
  REP(i, n)
  cin >> arr[i].first >> arr[i].second;
}
template <class T>
inline void outArr(T &arr)
{
  for (auto x : arr)
  {
    OUTSP(x);
  }
  OUTLF;
}

template <class T>
using PQ = priority_queue<T>;
template <class T>
using PQG = priority_queue<T, vector<T>, greater<T>>;

const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
const ll dx8[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy8[8] = {0, 1, 1, 1, 0, -1, -1, -1};

template <class T>
bool chmax(T &, const T &);
template <class T>
bool chmin(T &, const T &);

ll qp(ll a, ll b);
ll qp(ll a, ll b, ll mo);

ll mod_pow(ll, ll);
ll mod_add(ll, ll);
ll mod_mul(ll, ll);
ll mod_div(ll, ll);
void make_fact(ll);
void make_invfact(ll);
void init_fact();

ll combination(ll, ll);

#define FACSIZE 200002LL

ll invfac[FACSIZE];
ll fac[FACSIZE];

/*
unordered_map<ll, ll> um;
unordered_map<ll, ll> umU;
unordered_map<ll, ll> umD;
*/

vec um;
vec umU;
vec umD;

ll amariU(ll x, ll d)
{

  if (x == 0)
  {
    return umU[x] = 1 % d;
  }
  else
  {
    umU[x] = (umU[x - 1] * 2) % d;
  }
  return 0;
}
ll amariD(ll x, ll d)
{

  if (x == 0)
  {
    return umD[x] = 1 % d;
  }
  else
  {
    umD[x] = (umD[x - 1] * 2) % d;
  }
  return 0;
}

ll f(ll x)
{
  if (x == 0)
    return um[x] = 0;
  else if (x == 1)
    return um[x] = 1;
  //if (um.find(x) != end(um))
  if (um[x] != -1)
    return um[x];
  ll cnt = 0;
  ll orgx = x;
  while (x > 0)
  {
    cnt += x % 2;
    x /= 2;
  }
  return um[orgx] = f(orgx % cnt) + 1;
}

int main(void)
{
  um.resize(210000, -1);
  umU.resize(210000);
  umD.resize(210000);

  ll n;
  cin >> n;
  string x;
  cin >> x;

  REP(i, 200110)
  {
    f(i);
  }
  ll cnt = 0;

  REP(i, x.size())
  {
    char c = x[i];
    if (c == '1')
    {
      cnt++;
    }
  }
  if (cnt == 0)
  {
    REP(i, n)
    {
      cout << 1 << endl;
    }
    return 0;
  }
  else if (cnt == 1)
  {
    REP(i, 200010)
    {
      amariU(i, cnt + 1);
    }
    ll baseMU = 0;
    REP(i, n)
    {
      auto c = x[n - 1 - i];
      if (c == '1')
      {
        baseMU += umU[i];
        baseMU = baseMU % (cnt + 1);
      }
    }
    REP(i, x.size())
    {
      char c = x[i];

      if (c == '0')
      {
        ll MU = baseMU + (cnt + 1 + umU[n - 1 - i]);
        MU = MU % (cnt + 1);

        cout << um[MU] + 1 << endl;
      }
      else
      {
        cout << 0 << endl;
      }
    }

    return 0;
  }
  REP(i, 200010)
  {
    amariU(i, cnt + 1);
    amariD(i, cnt - 1);
  }

  ll baseMU = 0;
  ll baseMD = 0;

  REP(i, n)
  {
    auto c = x[n - 1 - i];
    if (c == '1')
    {
      baseMU += umU[i];
      baseMU = baseMU % (cnt + 1);
      baseMD += umD[i];
      baseMD = baseMD % (cnt - 1);
    }
  }

  REP(i, x.size())
  {
    char c = x[i];

    if (c == '0')
    {
      ll MU = baseMU + (cnt + 1 + umU[n - 1 - i]);
      MU = MU % (cnt + 1);

      cout << um[MU] + 1 << endl;
    }
    else
    {
      ll MD = baseMD + (cnt - 1 - umD[n - 1 - i]);
      MD = MD % (cnt - 1);

      cout << um[MD] + 1 << endl;
    }
  }
  return 0;
}

template <class T>
bool chmax(T &a, const T &b)
{
  if (a < b)
  {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
  if (b < a)
  {
    a = b;
    return 1;
  }
  return 0;
}

ll qp(ll a, ll b)
{
  ll ans = 1LL;
  do
  {
    if (b & 1LL)
      ans = 1LL * mod_mul(ans, a) % MOD;
    a = 1LL * mod_mul(a, a) % MOD;
  } while (b >>= 1LL);
  return ans;
}
ll qp(ll a, ll b, ll mo)
{
  ll ans = 1LL;
  do
  {
    if (b & 1LL)
      ans = 1LL * (ans % mo) * (a % mo);
    a = 1LL * (a % mo) * (a % mo);
  } while (b >>= 1LL);
  return ans;
}

ll mod_pow(ll x, ll r)
{
  if (r == 0)
    return 1;
  else if (r == 1)
    return x % MOD;
  else if (r % 2 == 0)
  {
    ll t = mod_pow(x, r / 2) % MOD;
    return t * t % MOD;
  }
  else
  {
    ll t = mod_pow(x, r / 2) % MOD;
    ll k = t * t % MOD;
    return k * x % MOD;
  }
}
ll mod_add(ll a, ll b)
{
  return (a + b) % MOD;
}

ll mod_mul(ll a, ll b)
{
  return (a * b) % MOD;
}

ll mod_div(ll a, ll b)
{
  return mod_mul(a, mod_pow(b, MOD - 2));
}

void make_fact(ll n)
{
  fac[0] = 1;
  REP(i, n)
  {
    fac[i + 1] = mod_mul(fac[i], i + 1);
  }
}

void make_invfact(ll n)
{
  invfac[n] = mod_pow(fac[n], MOD - 2);
  REP_R(i, n)
  {
    invfac[i] = mod_mul(invfac[i + 1], i + 1);
  }
}

void init_fact()
{
  make_fact(FACSIZE - 1);
  make_invfact(FACSIZE - 1);
}

ll combination(ll n, ll c)
{

  return mod_mul(fac[n], mod_mul(invfac[c], invfac[n - c]));
}
///////////////fact
/*
  init_fact();
  cout << fac[5] << endl;
  cout << invfac[5] << endl;
  cout << combination(8, 4) << endl;
  cout << combination(31, 8) << endl;
  //*/
///////////////////


Measured memory_bytes: 8588