#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3fll;
const int N = 1e6 + 10;
const int M = N * 2 + 10;
const int maxn = 50 * 50 + 10;
const int mod = (int)1e9 + 7;
const double eps = 1e-8;
const double pi = acos(-1.0);
int n;
int dp[N];
int fa[N];
char s[N];
void init() {
  int tp = -1;
  int lst = n + 1;
  for (int i = n; i; i--) {
    if (s[i] == '?')
      dp[i] = dp[i + 1] + 1;
    else {
      if (tp == -1) {
        dp[i] = dp[i + 1] + 1;
        tp = s[i] & 1;
      } else if (tp ^ (s[i] & 1)) {
        dp[i] = lst - i;
        tp = s[i] & 1;
      } else
        dp[i] = dp[i + 1] + 1;
      lst = i;
    }
  }
}
int fd(int x) { return x ^ fa[x] ? fa[x] = fd(fa[x]) : x; }
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> s + 1;
  init();
  for (int i = 1; i <= n + 1; i++) fa[i] = i;
  for (int i = 1; i <= n; i++) {
    int pos = fd(1);
    int cnt = 0;
    while (pos <= n) {
      while (pos <= n && dp[pos] < i) {
        fa[pos] = pos + 1;
        pos = fd(pos + 1);
      }
      if (pos > n) break;
      cnt++;
      if (dp[pos] == i) fa[pos] = pos + 1;
      pos = min(n + 1, pos + i);
      pos = fd(pos);
    }
    cout << cnt << ' ';
  }
  cout << '\n';
  return 0;
}
