#include <bits/stdc++.h>
using namespace std;
using INT = long long;
const int NN = 1010000;
char s[NN];
int prv[NN][2];
int nxt[NN][2];
int calc(int pos, int step, int st) {
  int nt = pos + step;
  int L = nt - max(pos, prv[nt][st]);
  int R = nxt[nt][st] - nt - 1;
  if (R + L < step) return 0x3f3f3f3f;
  return nt + (step - L);
}
int main() {
  int n;
  cin >> n;
  scanf("%s", s + 1);
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < 2; j++) {
      prv[i][j] = prv[i - 1][j];
      if (s[i] == '0' + j) prv[i][j] = i;
    }
  }
  for (int j = 0; j < 2; j++) nxt[n + 1][j] = n + 1;
  for (int i = n; i; i--) {
    for (int j = 0; j < 2; j++) {
      nxt[i][j] = nxt[i + 1][j];
      if (s[i] == '0' + j) nxt[i][j] = i;
    }
  }
  for (int i = 1; i <= n; i++) {
    int ans = 0, pos = 0;
    while (pos + i <= n) {
      int nt = min(calc(pos, i, 0), calc(pos, i, 1));
      if (nt == 0x3f3f3f3f) {
        pos += i;
        continue;
      }
      pos = nt;
      ans++;
    }
    printf("%d ", ans);
  }
}
