#include<iostream>
#include<stack>
#include<vector>
#include<algorithm>

using namespace std;

int main()
{
	stack<int> S1;
	stack<pair<int,int>> S2;
	int sum=0;
	char ch;
	for (int i = 0; cin>>ch; ++i)
	{
		if(ch=='\\')
		{
			S1.push(i);
		}
		else if(ch=='/'&&S1.size()>0)
		{
			int j=S1.top();
			S1.pop();
			int a=i-j;
			sum+=a;
			while(S2.size()>0&&S2.top().first>j)
			{
				a=S2.top().second+a;
				S2.pop();
			}
			S2.push(make_pair(j,a));
		}
	}

	vector<int> ans;
	while(S2.size()!=0)
	{
		ans.push_back(S2.top().second);
		S2.pop();
	}
	reverse(ans.begin(),ans.end());
	cout<<sum<<endl;
	int s=ans.size();
	cout<<s;
	for (int i = 0; i < s; ++i)
	{
		cout<<" "<<ans[i];
	}
	cout<<endl;
}
