#include <bits/stdc++.h>
#pragma GCC optimize("Ofast, unroll-loops", "omit-frame-pointer", "inline")
#pragma GCC option("arch=native", "tune=native", "no-zero-upper")
#pragma GCC target( \
    "sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native,avx2")
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll getrnd(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rng); }
template <typename T1, typename T2>
inline bool relax(T1& a, const T2& b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename T1, typename T2>
inline bool strain(T1& a, const T2& b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
int next(int v, vector<int>& par) {
  return par[v] == v ? v : (par[v] = next(par[v], par));
}
void solve() {
  int n;
  string s;
  cin >> n >> s;
  int lst[2] = {0, 0};
  vector<pair<int, int>> dist;
  for (int i = n - 1; i >= 0; --i) {
    ++lst[0], ++lst[1];
    if (s[i] != '?') lst[s[i] - '0'] = 0;
    dist.emplace_back(max(lst[0], lst[1]), i);
  }
  sort(dist.begin(), dist.end());
  vector<int> par(n + 1);
  iota(par.begin(), par.end(), 0);
  for (int x = 1, pos = 0; x <= n; ++x) {
    while (pos < n && dist[pos].first < x) {
      par[dist[pos].second] = dist[pos].second + 1;
      ++pos;
    }
    int res = 0;
    for (int i = 0; i < n;) {
      i = next(i, par);
      if (i == n) break;
      i += x;
      ++res;
    }
    cout << res << ' ';
  }
  cout << '\n';
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(nullptr);
  cout.tie(nullptr);
  srand(time(0));
  int t = 1;
  while (t--) solve();
  return 0;
}
