#include <bits/stdc++.h>
using namespace std;
#define endl '\n';
#define int long long
typedef pair<int, int> PII;
int read() {
	int x = 0;
	char c = getchar();
	while (c < '0' || c > '9') {
		c = getchar();
	}
	while (c >= '0' && c <= '9')
		x = x * 10 + c - '0', c = getchar();
	return x;
}
void write(int x) {
	if (x < 0)
		putchar('-'), x = -x;
	if (x > 9)
		write(x / 10);
	putchar(x % 10 + '0');
}
void print(int x, char c) { write(x), putchar(c); }
char c[2000010], crr[2000010];
int n, arr[1000010];
signed main() {
#ifndef ONLINE_JUDGE
	freopen("data/data1.in", "r", stdin);
	// freopen("data/data1.out", "w", stdout);
#endif
	scanf("%lld", &n);
	scanf("%s", crr);
	bool flag = true;
	for (int i = 0; i < n; i++) {
		if (crr[i] != '0')
			flag = false;
	}
	if (flag) {
		for (int i = 1; i <= n; i++)
			if (i != 1) {
				print((n) * (n - i + 1), '\n');
			} else
				print((n - i + 1) * (n - i + 1), '\n');

		return 0;
	}
	int idx = 0;
	while (crr[idx] == '0') {
		idx++;
	}
	int j = 0;
	for (int i = idx; i < n; i++) {
		c[j++] = crr[i];
	}
	for (int i = j; i < n; i++) {
		c[i] = '0';
	}
	for (int i = 0; i < n; i++) {
		int cnt = 0;
		while (c[i] == '0') {
			i++;
			cnt++;
		}
		arr[1] += cnt * (n);
		for (int j = 2; j <= (cnt + 1) / 2; j++) {
			arr[j] += (cnt + 1 - j - j + 1) * (n - j + 1);
		}
	}
	for (int i = 1; i <= n; i++) {
		print(arr[i], '\n');
	}
	return 0;
}