#include <bits/stdc++.h>
using namespace std;
const long long M = 1e9 + 7;
const long long mod = 998244353;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
vector<int> pf[2];
int nxt[(int)1e6 + 5], n;
int sum(int l, int r) {
  r = min(r, n - 1);
  if (l == 0) return max(pf[0][r], pf[1][r]);
  return max(pf[0][r] - pf[0][l - 1], pf[1][r] - pf[1][l - 1]);
}
int nxt_work(int idx, int sz) {
  if (idx == n or sum(idx, idx + sz - 1) == sz) return idx;
  return nxt[idx] = nxt_work(nxt[idx], sz);
}
void solve() {
  cin >> n;
  string s;
  cin >> s;
  pf[0].resize(n);
  pf[1].resize(n);
  for (int i = 0; i < n; i++) {
    if (s[i] == '?') {
      pf[0][i] = pf[1][i] = 1;
    } else
      pf[s[i] - '0'][i] = 1;
    if (i > 0) {
      pf[0][i] += pf[0][i - 1];
      pf[1][i] += pf[1][i - 1];
    }
  }
  for (int i = 0; i < n; i++) {
    nxt[i] = i + 1;
  }
  for (int i = 1; i <= n; i++) {
    int res = 0;
    for (int j = 0; j < n;) {
      int q = sum(j, j + i - 1);
      if (q == i) {
        res++;
        j += i;
      } else {
        j = nxt_work(j, i);
      }
    }
    cout << res << " ";
  }
  cout << endl;
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) {
    solve();
  }
}
