#include <bits/stdc++.h>
std::mt19937 rng(
    (int)std::chrono::steady_clock::now().time_since_epoch().count());
using namespace std;
long long mod = (1000000007LL);
inline long long Mod(long long a, long long b) { return (a % b); }
inline long long poww(long long a, long long b) {
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = (res * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return res;
}
long long gcd(long long a, long long b) {
  while (b) {
    a %= b, swap(a, b);
  }
  return a;
}
void read(vector<int> &w, int n) {
  w.resize(n);
  for (int i = 0; i < n; i++) cin >> w[i];
}
void print(vector<int> &w) {
  for (int i = 0; i < (int)(w).size(); i++) {
    if (i == (int)(w).size() - 1)
      cout << w[i] << "\n";
    else
      cout << w[i] << " ";
  }
}
int prodmod(vector<int> w);
int summod(vector<int> w);
int n, m, q, k, v[1000050], ans;
pair<int, int> w[1000050];
string second;
int nxt[1000050];
int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  cin >> second;
  vector<int> pref[3];
  pref[0].resize(n);
  pref[1].resize(n);
  vector<int> caras[2];
  for (int i = 0; i < n; i++) {
    if (i > 0) {
      pref[0][i] = pref[0][i - 1];
      pref[1][i] = pref[1][i - 1];
    }
    if (second[i] != '?')
      pref[second[i] - '0'][i]++, caras[second[i] - '0'].push_back(i);
    else
      pref[2].push_back(i);
  }
  for (int i = 0; i < n; i++) {
    int ini = 0, fim = (int)(caras[0]).size() - 1, mid, best = -1;
    while (fim >= ini) {
      mid = (ini + fim) / 2;
      if (caras[0][mid] <= i) {
        best = caras[0][mid];
        ini = mid + 1;
      } else
        fim = mid - 1;
    }
    ini = 0, fim = (int)(caras[1]).size() - 1, mid;
    int best2 = -1;
    while (fim >= ini) {
      mid = (ini + fim) / 2;
      if (caras[1][mid] <= i) {
        best2 = caras[1][mid];
        ini = mid + 1;
      } else
        fim = mid - 1;
    }
    if (best != -1 and best2 != -1) {
      nxt[i] = min(best + 1, best2 + 1);
    }
  }
  for (int x = 1; x <= n; x++) {
    int l = 0, r = x - 1, ans = 0;
    while (r < n) {
      int qtd0 = pref[0][r] - (l > 0 ? pref[0][l - 1] : 0);
      int qtd1 = pref[1][r] - (l > 0 ? pref[1][l - 1] : 0);
      if (qtd0 == 0 or qtd1 == 0) {
        ans++;
        l += x;
        r = l + x - 1;
      } else {
        if (nxt[r] <= l) {
          break;
        }
        l = nxt[r];
        r = l + x - 1;
      }
    }
    cout << ans << " ";
  }
  cout << "\n";
}
int summod(vector<int> w) {
  int curr = 0;
  for (int i = 0; i < (int)(w).size(); i++) {
    curr = (curr + w[i]) % mod;
    if (curr < 0) curr += mod;
  }
  return curr;
}
int prodmod(vector<int> w) {
  int curr = 1;
  for (int i = 0; i < (int)(w).size(); i++) {
    if (w[i] >= mod) w[i] %= mod;
    curr = (curr * w[i]) % mod;
    if (curr < 0) curr += mod;
  }
  return curr;
}
