#include<bits/stdc++.h>
using namespace std;
long long fr,n,cnt=0,x=1,a[114514],t=0,n2=1145,cnt2;
bool b=false;
char c;
int main()
{
	scanf("%c",&c);
	n=c-'0';
	if(n==1)
	{
		a[t]=0;
		t++;
	}
	cnt++;
	cnt2=1;
	while(~scanf("%c",&c))
	{
		x++;
		if(c=='\n')
		{
			if(b==false)
			{
				n2=x-1;
				b=true;
			}
			continue;
		}
		cnt2++;
		fr=n;
		n=c-'0';
		if(fr!=n)
		{
			a[t]=cnt;
			t++;
			cnt=1;
			continue;
		}
		else
		{
			cnt++;
		}
		if(cnt2==(n2*n2))
		{
			a[t]=cnt;
			t++;
			break;
		}
	}
	printf("%lld ",n2);
	for(long long i=0;i<t;i++)
	{
		printf("%lld ",a[i]);
	}
	printf("\n");
	return 0;
}