#include<bits/stdc++.h>
using namespace std;
#define M 100005
char a[M];
int n,l[M],r[M],cnt,ac[M],ans[M];
void solve(int x){
	if(cnt){
		if(cnt&&l[1]-x<1)return;
		for(int i=2;i<=cnt;++i)if(l[i]-x<=r[i-1]+1)return;
		for(int i=1;i<=n;++i)ac[i]=0;
		for(int i=1;i<=cnt;++i)for(int j=l[i]-x;j<=r[i];++j)ac[j]=1;
		for(int i=n-x+1;i<=n;++i)if(ac[i])return;
		for(int i=0;i<=n-x;++i)if(ac[i]==0){
			int j=i;
			while(j<=n-x+1&&ac[j]==0)++j;
			if(j-i==1)continue;
			if(j-i==2)return;
			if(x==0)return;
			if(x==1&&!((j-i)&1))return;
			if(j-i>2){
				int ed=j-2,st=i+1;
				while(st<=ed){
					if(ed-st+1==1)ac[st]=1,st=ed+1;
					else if(ed-st+1==2)ac[st]=1,ac[st+1]=1,st=ed+1;
					else ac[st]=1,st+=2;
				}
				}
				i=j-1;
			}
		}
	int tot=0;
	for(int i=1;i<=n;++i)if(ac[i]){
		++tot;int j=i;
		while(j<=n&&ac[j])ans[tot]++,j++;
		i=j-1;
	}
	printf("%d\n",tot);
	for(int i=1;i<=tot;++i)printf("%d ",ans[i]);
	exit(0);
}
int main(){
	scanf("%s",a+1);
	n=strlen(a+1);
	for(int i=1;i<=n;++i)if(a[i]=='#'){
		l[++cnt]=i;int j=i;
		while(j<=n&&a[j]=='#')++j;
		r[cnt]=j-1;i=j-1;
	}
	for(int i=0;i<=3;++i)solve(i);
	puts("-1");
}