#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n;
  cin >> n;
  string s;
  cin >> s;
  vector<int> nxt0(n), nxt1(n);
  vector<vector<int> > p0(n + 1), p1(n + 1);
  int cnt0 = 0, cnt1 = 0;
  for (int i = n - 1; i >= 0; i--) {
    if (s[i] == '1' || s[i] == '?') {
      cnt1++;
    } else {
      cnt1 = 0;
    }
    if (s[i] == '0' || s[i] == '?') {
      cnt0++;
    } else {
      cnt0 = 0;
    }
    nxt0[i] = cnt1;
    nxt1[i] = cnt0;
  }
  cnt1 = 0;
  cnt0 = 0;
  for (int i = 0; i < n; i++) {
    if (s[i] == '1' || s[i] == '?') {
      cnt1++;
    } else {
      cnt1 = 0;
    }
    if (s[i] == '0' || s[i] == '?') {
      cnt0++;
    } else {
      cnt0 = 0;
    }
    if (cnt0 != 0) p0[cnt0].push_back(i - cnt0 + 1);
    if (cnt1 != 0) p1[cnt1].push_back(i - cnt1 + 1);
  }
  for (int i = 0; i <= n; i++) {
    p0[i].push_back(n);
    p1[i].push_back(n);
  }
  cout << n << " ";
  for (int x = 2; x <= n; x++) {
    int tot = 0;
    int i = 0;
    while (i < n) {
      if (nxt0[i] >= x) {
        int add = (nxt0[i] / x);
        tot += add;
        i += add * x;
      } else if (nxt1[i] >= x) {
        int add = (nxt1[i] / x);
        tot += add;
        i += add * x;
      } else {
        int i0 = *(lower_bound(p0[x].begin(), p0[x].end(), i));
        int i1 = *(lower_bound(p1[x].begin(), p1[x].end(), i));
        i = min(i0, i1);
      }
    }
    cout << tot << " ";
  }
  return 0;
}
