#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<stack>
#include<algorithm>
#include<vector>
#include<string>
using namespace std;

int main(){
	stack<int> S1;
	stack<pair<int, int> > S2;
	char slope;
	int i = 0;
	int sum = 0;
	while (cin >> slope){
		if (slope == '\\'){
			S1.push(i);
		}
		else if (slope == '/'&&S1.size() > 0){
			int j = S1.top(); S1.pop();
			sum += i - j;
			int a = i - j;
			while (S2.size() > 0 && S2.top().first > j){
				a += S2.top().second; S2.pop();
			}
			S2.push(make_pair(j, a));
		}
		i++;
	}
	vector<int> ans;
	int t = 0;
	while (S2.size() > 0){
		ans.push_back(S2.top().second); S2.pop();
	}
	reverse(ans.begin(), ans.end());
	cout << sum << endl;
	cout << ans.size();
	for (int i = 0; i < ans.size(); i++){
		cout << " ";
		cout << ans[i];
	}
	cout << endl;
	return 0;
}