#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const int N = 1e6 + 5;
int n, pre[N][2];
char ch[N];
int main() {
  cin >> n >> (ch + 1);
  for (register int i = 1; i <= n; i++) {
    pre[i][0] = pre[i - 1][0];
    pre[i][1] = pre[i - 1][1];
    if (ch[i] == '?') continue;
    pre[i][ch[i] - '0'] = i;
  }
  for (register int x = 1; x <= n; x++) {
    int l = 1, r, ans = 0;
    while (l + x - 1 <= n) {
      r = l + x - 1;
      if (pre[r][0] == pre[l - 1][0] || pre[r][1] == pre[l - 1][1])
        ans++, l = l + x;
      else
        l = min(pre[r][0], pre[r][1]) + 1;
    }
    cout << ans << " ";
  }
}
