#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline bool upmin(T &x, T y) {
  return y < x ? x = y, 1 : 0;
}
template <typename T>
inline bool upmax(T &x, T y) {
  return x < y ? x = y, 1 : 0;
}
const long double eps = 1e-9;
const long double pi = acos(-1);
const int oo = 1 << 30;
const long long loo = 1ll << 60;
const int mods = 998244353;
const int MAXN = 1000005;
const int MX = 300000;
const int G = 3;
const int Gi = (mods + 1) / G;
const int INF = 0x3f3f3f3f;
namespace FastIO {
constexpr int SIZE = (1 << 21) + 1;
int num = 0, f;
char ibuf[SIZE], obuf[SIZE], que[65], *iS, *iT, *oS = obuf,
                                                *oT = obuf + SIZE - 1, c;
inline void flush() {
  fwrite(obuf, 1, oS - obuf, stdout);
  oS = obuf;
}
inline void putc(char c) {
  *oS++ = c;
  if (oS == oT) flush();
}
inline void getc(char &c) {
  for (c = (iS == iT ? (iT = ((iS = ibuf) + fread(ibuf, 1, SIZE, stdin)),
                       (iS == iT ? EOF : *iS++))
                     : *iS++);
       (c != '0' && c != '1' && c != '?') && c != EOF;
       c = (iS == iT ? (iT = ((iS = ibuf) + fread(ibuf, 1, SIZE, stdin)),
                       (iS == iT ? EOF : *iS++))
                     : *iS++))
    ;
}
inline void reads(char *st) {
  char c;
  int n = 0;
  getc(st[++n]);
  for (c = (iS == iT ? (iT = ((iS = ibuf) + fread(ibuf, 1, SIZE, stdin)),
                       (iS == iT ? EOF : *iS++))
                     : *iS++);
       c == '0' || c == '1' || c == '?';
       c = (iS == iT ? (iT = ((iS = ibuf) + fread(ibuf, 1, SIZE, stdin)),
                       (iS == iT ? EOF : *iS++))
                     : *iS++))
    st[++n] = c;
}
template <class I>
inline void read(I &x) {
  for (f = 1, c = (iS == iT ? (iT = ((iS = ibuf) + fread(ibuf, 1, SIZE, stdin)),
                              (iS == iT ? EOF : *iS++))
                            : *iS++);
       c < '0' || c > '9';
       c = (iS == iT ? (iT = ((iS = ibuf) + fread(ibuf, 1, SIZE, stdin)),
                       (iS == iT ? EOF : *iS++))
                     : *iS++))
    if (c == '-') f = -1;
  for (x = 0; c >= '0' && c <= '9';
       c = (iS == iT ? (iT = ((iS = ibuf) + fread(ibuf, 1, SIZE, stdin)),
                       (iS == iT ? EOF : *iS++))
                     : *iS++))
    x = (x << 3) + (x << 1) + (c & 15);
  x *= f;
}
template <class I>
inline void print(I x) {
  if (x < 0) putc('-'), x = -x;
  if (!x) putc('0');
  while (x) que[++num] = x % 10 + 48, x /= 10;
  while (num) putc(que[num--]);
}
struct Flusher_ {
  ~Flusher_() { flush(); }
} io_Flusher_;
}  // namespace FastIO
using FastIO ::print;
using FastIO ::putc;
using FastIO ::read;
using FastIO ::reads;
char st[MAXN];
int mx[MAXN << 2], a[MAXN], b[MAXN];
void build(int x, int l, int r) {
  if (l == r) {
    mx[x] = a[l];
    return;
  }
  int mid = (l + r) >> 1;
  build(x << 1, l, mid);
  build(x << 1 | 1, mid + 1, r);
  mx[x] = max(mx[x << 1], mx[x << 1 | 1]);
}
int query(int x, int l, int r, int L, int y) {
  if (mx[x] < y) return -1;
  if (l == r) return l;
  int mid = (l + r) >> 1;
  if (L > mid)
    return query(x << 1 | 1, mid + 1, r, L, y);
  else {
    int t = query(x << 1, l, mid, L, y);
    if (t != -1) return t;
    return query(x << 1 | 1, mid + 1, r, mid + 1, y);
  }
}
signed main() {
  int n, cnt0 = 0, cnt1 = 0;
  read(n), reads(st);
  for (int i = 1, l = 1; i <= n; ++i) {
    auto add = [&](char x, int y) {
      if (x == '0') cnt0 += y;
      if (x == '1') cnt1 += y;
    };
    add(st[i], 1);
    while (cnt0 && cnt1) add(st[l++], -1);
    a[i] = i - l + 1;
  }
  cnt0 = 0, cnt1 = 0;
  for (int i = n, r = n; i >= 1; --i) {
    auto add = [&](char x, int y) {
      if (x == '0') cnt0 += y;
      if (x == '1') cnt1 += y;
    };
    add(st[i], 1);
    while (cnt0 && cnt1) add(st[r--], -1);
    b[i] = r - i;
  }
  build(1, 1, n);
  for (int i = 1; i <= n; ++i) {
    int cnt = 0, r = 1;
    for (; r <= n;) {
      r = query(1, 1, n, r, i);
      if (r == -1) break;
      int p = b[r] / i;
      cnt += p + 1, r += i * (p + 1);
    }
    print(cnt), putc(' ');
  }
  return 0;
}
