#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1);
const double eps = 1e-9;
const int mf[] = {0, 0, 1, -1}, mc[] = {1, -1, 0, 0};
const int N = 200005;
const int inf = 1e9;
mt19937 rng(
    (unsigned int)chrono::steady_clock::now().time_since_epoch().count());
template <typename T>
static T randint(T lo, T hi) {
  return uniform_int_distribution<T>(lo, hi)(rng);
}
template <typename T>
static T randreal(T lo, T hi) {
  return uniform_real_distribution<T>(lo, hi)(rng);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  rng.seed(time(0));
  int n;
  cin >> n;
  string s;
  cin >> s;
  s = " " + s;
  vector<int> c0(n + 1), c1(n + 1);
  for (int i = 1; i <= n; i++) {
    c0[i] = c0[i - 1] + (s[i] == '0');
    c1[i] = c1[i - 1] + (s[i] == '1');
  }
  vector<int> v(n + 1);
  vector<pair<int, int>> ord;
  for (int i = 1; i <= n; i++) {
    int lo = 1, hi = i;
    while (lo < hi) {
      int m = (lo + hi) >> 1;
      bool ok;
      if (s[i] == '0')
        ok = (c1[i] - c1[m - 1] == 0);
      else if (s[i] == '1')
        ok = (c0[i] - c0[m - 1] == 0);
      else
        ok = (c1[i] - c1[m - 1] == 0) || (c0[i] - c0[m - 1] == 0);
      if (ok)
        hi = m;
      else
        lo = m + 1;
    }
    v[i] = i - lo + 1;
    ord.push_back({v[i], i});
  }
  sort(ord.begin(), ord.end());
  vector<int> nxt(n + 2);
  iota(nxt.begin(), nxt.end(), 0);
  function<int(int)> get_nxt = [&](int u) {
    return nxt[u] == u ? u : nxt[u] = get_nxt(nxt[u]);
  };
  vector<int> ans(n + 1);
  int pt = 0;
  for (int x = 1; x <= n; x++) {
    while (pt < n && ord[pt].first < x) {
      nxt[ord[pt].second] = ord[pt].second + 1;
      pt++;
    }
    int last = 0;
    while (last + x <= n) {
      int prox = get_nxt(last + x);
      if (prox == n + 1) break;
      ans[x]++;
      last = prox;
    }
  }
  for (int i = 1; i <= n; i++) cout << ans[i] << " \n"[i == n];
  return 0;
}
