Problem: Joseph really likes the culture of Japan. Last year he learned Japanese traditional clothes and visual arts and now he is trying to find out the secret of the Japanese game called Nonogram.

In the one-dimensional version of the game, there is a row of n empty cells, some of which are to be filled with a pen. There is a description of a solution called a profile — a sequence of positive integers denoting the lengths of consecutive sets of filled cells. For example, the profile of [4, 3, 1] means that there are sets of four, three, and one filled cell, in that order, with at least one empty cell between successive sets.

<image>

A suitable solution for n = 12 and p = [4, 3, 1]. 

<image>

A wrong solution: the first four filled cells should be consecutive. 

<image>

A wrong solution: there should be at least one empty cell before the last filled cell. 

Joseph found out that for some numbers n and profiles p there are lots of ways to fill the cells to satisfy the profile. Now he is in the process of solving a nonogram consisting of n cells and a profile p. He has already created a mask of p — he has filled all the cells that must be filled in every solution of the nonogram.

<image>

The mask for n = 12 and p = [4, 3, 1]: all the filled cells above are filled in every solution. 

After a break, he lost the source profile p. He only has n and the mask m. Help Joseph find any profile p' with the mask m or say that there is no such profile and Joseph has made a mistake.

Input

The only line contains a string m — the mask of the source profile p. The length of m is n (1 ≤ n ≤ 100 000). The string m consists of symbols # and _ — denoting filled and empty cells respectively.

Output

If there is no profile with the mask m, output the number -1. Otherwise, on the first line, output an integer k — the number of integers in the profile p'. On the second line, output k integers of the profile p'.

Examples

Input


__#_____


Output


2
3 2 


Input


_#


Output


-1


Input


___


Output


0

Solution (in CPP):

Solution:
#include<bits/stdc++.h>
using namespace std;
#define N 100005
int read(){
	int w=0,f=1;
	char c=' ';
	while(c<'0'||c>'9')c=getchar(),f=c=='-'?-1:f;
	while(c>='0'&&c<='9')w=w*10+c-48,c=getchar();
	return w*f;
}
struct node{
	int l,r;
	node(int L,int R){l=L,r=R;}
	node(){l=r=0;}
}c[N],ans[N];
int n,a[N],b[N],cnt;
char s[N];
void print(){
	int x=0,it=0;
	for(int i=1;i<=cnt&&!x;i++)
		if(ans[i].l>ans[i+1].l)x=i,it=i+1;
	printf("%d\n",cnt);
	for(int i=1;i<=x;i++){
		while(it<=cnt&&ans[it].l<ans[i].l)printf("%d ",ans[it].r-ans[it].l+1),it++;
		printf("%d%c",ans[i].r-ans[i].l+1,i==x&&it==cnt?'\n':' ');
	}
	while(it<=cnt)printf("%d%c",ans[it].r-ans[it].l+1,it==cnt?'\n':' '),it++;
	exit(0);
}
bool check(){
	for(int i=2;i<n;i++)
		if(!a[i]&&!(a[i-1]&&a[i+1]))return 0;
	return 1;
}
void solve(int k){
	for(int i=1;i<=n;i++)
		a[i]=b[i];
	for(int i=1;i<=n;i++)
		if(a[i]&&!a[i-1])
			for(int j=i-k;j<=i-1;j++){
				if(a[j])return;
				a[j]=1;
			}
	int tot=0;
	for(int i=1;i<=n-k;i++)
		if(!a[i]){
			int j=i+1;
			while(j<=n-k&&!a[j])j++;
			j--,c[++tot]=node(i,j),i=j;
		}
	if(c[1].l==1)c[1].l--;
	if(c[tot].r==n-k)c[tot].r++;
	if(k==1){
		for(int i=1;i<=tot;i++)
			if(!((c[i].r-c[i].l+1)&1))return;
		for(int i=1;i<=cnt;i++)
			ans[i].l-=k;
		for(int i=1;i<=tot;i++)
			for(int j=1;j<=(c[i].r-c[i].l)/2;j++)
				ans[++cnt]=node(c[i].l+j*2-1,c[i].l+j*2-1);
		print();
	}
	for(int i=1;i<=tot;i++)
		if(c[i].r-c[i].l+1==2)return;
	for(int i=1;i<=cnt;i++)
		ans[i].l-=k;
	for(int i=1;i<=tot;i++){
		if((c[i].r-c[i].l+1)&1){
			for(int j=1;j<=(c[i].r-c[i].l+1)/2;j++)
				ans[++cnt]=node(c[i].l+j*2-1,c[i].l+j*2-1);
		}
		else{
			for(int j=1;j<=(c[i].r-c[i].l+1)/2-2;j++)
				ans[++cnt]=node(c[i].l+j*2-1,c[i].l+j*2-1);
			ans[++cnt]=node(c[i].r-2,c[i].r-1);
		}
	}
	print();
}
signed main(){
	scanf("%s",s+1);
	n=strlen(s+1);
	for(int i=1;i<=n;i++)
		a[i]=b[i]=s[i]=='#'?1:0;
	int l=n+1,r=n+1;
	for(int i=1;i<=n;i++)
		if(a[i])l=min(l,i-1),r=min(r,n-i);
	for(int i=1;i<=n;i++){
		if(a[i]){
			int j=i+1;
			while(j<=n&&a[j])j++;
			j--,ans[++cnt]=node(i,j),i=j;
		}
	}
	if(l==n+1)return puts("0\n"),0;
	if(!l&&!r){
		if(check())print();
		return puts("-1"),0;
	}
	if(!l||!r)return puts("-1"),0;
	if(min(l,r)==1)return solve(1),puts("-1"),0;
	if(min(l,r)==2)return solve(2),puts("-1"),0;
	if(l==3)return solve(1),solve(3),puts("-1"),0;
	if(l&1)return solve(1),solve(2),solve(3),puts("-1"),0;
	solve(2),solve(3),puts("-1");
	return 0;
}