#include <bits/stdc++.h>
using namespace std;
const int K = 20;
const int N = 1000100;
int A[N];
char s[N];
int Ans[N];
int Dp[N][2];
int Sp[N][K];
int main() {
  int n;
  scanf("%d", &n);
  scanf("%s", s);
  for (int i = 0; i < n; i++) {
    if (s[i] == '?') {
      Dp[i][0] = 1 + (i > 0 ? Dp[i - 1][0] : 0);
      Dp[i][1] = 1 + (i > 0 ? Dp[i - 1][1] : 0);
    } else {
      Dp[i][s[i] - '0'] = 1 + (i > 0 ? Dp[i - 1][s[i] - '0'] : 0);
    }
  }
  for (int i = 0; i < n; i++) A[i] = max(Dp[i][0], Dp[i][1]);
  for (int i = 0; i < n; i++) Sp[i][0] = A[i];
  for (int i = n - 1; ~i; --i)
    for (int k = 1; k < K; k++)
      if (i + (1 << k) <= n)
        Sp[i][k] = max(Sp[i][k - 1], Sp[i + (1 << (k - 1))][k - 1]);
  for (int x = 1; x <= n; x++) {
    int Res = 0;
    for (int i = -1; i < n;) {
      i += x;
      for (int k = K - 1; ~k; --k)
        if (i + (1 << k) <= n && Sp[i][k] < x) i += (1 << k);
      if (i < n) Res++;
    }
    Ans[x] = Res;
  }
  for (int x = 1; x <= n; x++) printf("%d ", Ans[x]);
  puts("");
}
