#include<bits/stdc++.h>

#define ll long long
#define mk make_pair
#define fi first
#define se second

using namespace std;

inline int read(){
	int x=0,f=1;char c=getchar();
	for(;(c<'0'||c>'9');c=getchar()){if(c=='-')f=-1;}
	for(;(c>='0'&&c<='9');c=getchar())x=x*10+(c&15);
	return x*f;
}

const int mod=998244353;
int ksm(int x,ll y,int p=mod){
	int ans=1;y%=(p-1);
	for(int i=y;i;i>>=1,x=1ll*x*x%p)if(i&1)ans=1ll*ans*x%p;
	return ans%p;
}
int inv(int x,int p=mod){return ksm(x,p-2,p)%p;}
mt19937 rnd(time(0));
int randint(int l,int r){return rnd()%(r-l+1)+l;}
void add(int &x,int v){x+=v;if(x>=mod)x-=mod;}
void Mod(int &x){if(x>=mod)x-=mod;}
int cmod(int x){if(x>=mod)x-=mod;return x;}

template<typename T>void cmax(T &x,T v){x=max(x,v);}
template<typename T>void cmin(T &x,T v){x=min(x,v);}

const int N=3e5+5;

int n;
#define ull unsigned long long
const ull U=18446744073709551615; // 2^64 - 1
struct Bit{
	ull v[N>>6];
	void clear(int k){for(int i=0;i<=(k>>6);i++)v[i]=0;}
	ull getc(int p){
//		cout<<"getc p = "<<p<<endl;
		return (v[p>>6]>>(p&63))&1;
	}
	void revc(int p){v[p>>6]^=(1ull<<(p&63));}
	void andc(int p,ull c){
//		cout<<"andc "<<p<<" "<<c<<endl;
		if(c==0&&getc(p)==1)revc(p);
	}
	void orc(int p,ull c){if(c==1&&getc(p)==0)revc(p);}
	void print(int k){
		for(int i=0;i<k;i++)cout<<getc(i);
	}
	void OR(int l,int r,Bit &T){
//		if(r-l+1>=90000)cerr<<"OR l,r = "<<l<<" "<<r<<'\n';
//		cout<<"OR l,r = "<<l<<" "<<r<<" T = ";T.print(70);puts("");
		assert((l&63)==0); // 0 -> l
		if((l>>6)==(r>>6)){
			for(int i=l;i<=r;i++)orc(i-l,T.getc(i));
			return ;
		}
		int nr=r;while(r>=0&&(r>>6)==(nr>>6))orc(r-l,T.getc(r)),r--;
		for(int i=(l>>6);i<=(r>>6);i++)v[i-(l>>6)]|=T.v[i];
	}
	void AND(int l,int r,Bit &T){
		assert((l&63)==0); // 0 -> l
//		cout<<"AND l,r = "<<l<<" "<<r<<" T = ";T.print(70);puts("");
		if((l>>6)==(r>>6)){
			for(int i=l;i<=r;i++)andc(i-l,T.getc(i));
			return ;
		}
		int nr=r;while(r>=0&&(r>>6)==(nr>>6))andc(r-l,T.getc(r)),r--;
		for(int i=(l>>6);i<=(r>>6);i++)v[i-(l>>6)]&=T.v[i];
	}
	int count(int k){ // [0,k)
		int ans=0;
//		cout<<"count k = "<<k<<endl;
		for(int i=0;i<(k>>6);i++)ans+=__builtin_popcountll(v[i]);
		int nk=k;k--;while(k>=0&&(k>>6)==(nk>>6))ans+=getc(k),k--;
		return ans;
	}
}A[64],B[64],C;

// A[j] : A << j

signed main(void){

#ifndef ONLINE_JUDGE
	freopen("in.in","r",stdin);
//	freopen("out.out","w",stdout);
#endif

	n=read();
//	cout<<"n = "<<n<<endl;
	for(int i=0;i<n;i++){
		for(int j=0;j<64;j++)A[j].revc(i+j);
	}
//	int cnt=0;
	for(int i=0;i<n;i++){
		char c=getchar();while(c!='0'&&c!='1'&&c!='?')c=getchar();
		if(c=='0')for(int j=0;j<64;j++)A[j].revc(i+j);
		if(c=='1')for(int j=0;j<64;j++)B[j].revc(i+j);
//		cout<<c;cnt+=(c=='1');
	}
//	puts("");
//	cout<<cnt<<endl;
	
//	for(int i=0;i<64;i++){
//		cout<<"A "<<i<<" = ";A[i].print(70);puts("");
//		cout<<"B "<<i<<" = ";B[i].print(70);puts("");
//	}
	
	for(int k=1;k<=n;k++){
//	for(int k=99;k<=99;k++){
//		cout<<"k = "<<k<<endl;
		int ans=0;C.clear(k);
		for(int l=0,r=k-1;l<n;l=r+1,r=l+k-1){
//			cout<<"l,r = "<<l<<" "<<r<<endl;
			int rc=(64-(l%64))%64;
//			cout<<"rc = "<<rc<<endl;
			C.OR(l+rc,r+rc,B[rc]);
//			cout<<"--OR--> C = ";C.print(k);puts("");
			C.AND(l+rc,r+rc,A[rc]);
//			cout<<"--AND--> C = ";C.print(k);puts("");
			ans+=C.count(k);
//			cout<<"Count = "<<C.count(k)<<endl;
		}
		cout<<ans<<'\n';
	}

	return 0;
}