import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;


class Main {


   public static void main(String args[]) throws IOException{

	   BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	   String[] string =  br.readLine().split("");
	   int n = string.length;

	   PairList buffpair = new PairList();
	   Lakelist lakes = new Lakelist();
	   buff[] operand = new buff[n];

	   int x = 0;
	   int y = 0;

       int upcount = 0;
       int downcount = 0;

       for(int i = 0; i < n ;i++,x++){
    	   operand[i] = new buff();
    	   if( string[i].equals("\\") ){


    		  if( upcount == 0){
    		   y = y - 1;
    		  }
    		  upcount = 0;
   		   downcount = 1;
    	   }else  if( string[i].equals("/") ){


    		  if( downcount == 0){
    		   y = y + 1;
    		  }
    		  upcount = 1;
   		      downcount = 0;
    	   }else if(string[i].equals("_")){

    	   }


    	   operand[i].setbuff(string[i], x, y);

       }

       int lake = 0;
       for(int i = 0; i < n ;i++){
    	   if( operand[i].string.equals("\\") ){
    		   for(int j = i+1; j < n ;j++){
    			   if( operand[j].string.equals("/") && operand[i].y == operand[j].y){
    				   buffpair.insert(operand[i].x, operand[j].x, operand[i].y, lake);
    				   lake++;
    				   break;
    			   }

    		   }

    	   }

       }






       buffpair.sethight();
       //System.out.println();

       buffpair.includeLake();
       buffpair.setlakenumber();

       buffpair.makelake(lakes);

       lakes.printsum();
       lakes.printlist();


   }


}


class buff {

	String string;
    int x;
    int y;

    void setbuff(String s, int X, int Y) {
        string = s;
        x = X;
        y = Y;
    }

    void printbuff(){

    	System.out.println(" x:"+x+" y:"+y+ " ?????????:"+string);
    }

}


class pair {

	int locationleft;
	int locationright;
    int width;
    int height;
    int lakenumber;
    boolean exist;

    pair prev;
    pair next;
    pair(int L, int R ,int H, int Lake) {
    	locationleft = L;
        locationright = R;
        width = ((R - L + 1) - 2 ) + 1;
        height = H;
        lakenumber = Lake;
        exist = true;
 	}


 	void setNext(pair next) {
         this.next = next;
     }

}

class PairList{

	pair dummy;

    pair tail;

    PairList() {
        // ??????????????????????????????next??¨prev????????????????????????????¨??????????
        dummy = new pair(-2,-2,-2,-2);
        dummy.next = dummy;
        dummy.prev = dummy;
        tail = dummy;
    }


	void insert(int left , int right, int H , int lake) {//?????????????´?????????\
        // ???????????????

        pair c = new pair(left , right,  H , lake);
        c.next = dummy.next;
        c.prev = dummy;
        dummy.next.prev = c;
        dummy.next = c;
        tail = dummy.prev;

    }

	void sethight() {//??????????????±?????????????????????

		for(pair end = dummy.next; end!=dummy; end = end.next ){

			for(pair tmp = end.next; tmp!=dummy; tmp = tmp.next ){

               if( end.height < tmp.height ){

            	   chengebuff(end,tmp);
               }
			}
		}
	}

	void setlakenumber() {//??????????????±?????????????????????

		for(pair end = dummy.next; end!=dummy; end = end.next ){

			for(pair tmp = end.next; tmp!=dummy; tmp = tmp.next ){

               if( end.lakenumber < tmp.lakenumber ){

            	   chengebuff(end,tmp);
               }
			}
		}
	}

	void includeLake() {//???????°´???????????????????°´??????????????´???

		for(pair end = dummy.next; end!=dummy; end = end.next ){

			for(pair tmp = end.next; tmp!=dummy; tmp = tmp.next ){

               if( end.height > tmp.height && end.locationleft < tmp.locationleft && end.locationright > tmp.locationright){

            	   tmp.lakenumber = end.lakenumber;


               }
			}
		}
	}


	void clearpair(pair clear ){


		for(pair end = dummy.next; end!=dummy; end = end.next ){
              if (end == clear  ){

            	  end.prev.next = clear.next;
            	  end.next.prev = clear.prev;
                  break;
              }

		}




	}


	void makelake(Lakelist lakes){

		int tmp = dummy.next.lakenumber;
        int sum = dummy.next.width;
		for(pair end = dummy.next; end!=dummy; end = end.next ){


			if(tmp != end.lakenumber){
				//System.out.println(sum);
                lakes.insert(sum);
				tmp = end.lakenumber;

				sum = end.width;

			}else{
				if( end.prev != dummy ){
					sum += end.width;
				}

			}
			//System.out.println(end.lakenumber+" "+sum+" " +tmp);

			if( end.next == dummy ){
				lakes.insert(sum);
			}

		}


	}

	void chengebuff(pair pair1,pair pair2  ) {//??????????????¨???

		int tmp;
		tmp = pair1.locationleft;
		pair1.locationleft = pair2.locationleft;
		pair2.locationleft = tmp;

		tmp = pair1.locationright;
		pair1.locationright = pair2.locationright;
		pair2.locationright = tmp;

		tmp = pair1.height;
		pair1.height = pair2.height;
		pair2.height = tmp;

		tmp = pair1.lakenumber;
		pair1.lakenumber = pair2.lakenumber;
		pair2.lakenumber = tmp;

		tmp = pair1.width;
		pair1.width = pair2.width;
		pair2.width = tmp;

	}





	void printlist() {//??????????????¨???

		for(pair end = dummy.next; end!=dummy; end = end.next ){

		  if(end.exist){
			System.out.println( "??????:" + end.locationleft+ " ??????: "+end.locationright+" ???:"+end.width+ " ??????:"+end.height+" ?°´???????????????:"+end.lakenumber );
		  }

		}


        System.out.println();

	}


}

class Lake{

	int depth;
	Lake next;
	Lake prev;

	Lake(int d) {
    	depth = d;
 	}

}

class Lakelist{

	Lake dummy;

	Lake tail;

	Lakelist() {
        // ??????????????????????????????next??¨prev????????????????????????????¨??????????
        dummy = new Lake(0);
        dummy.next = dummy;
        dummy.prev = dummy;
        tail = dummy;
    }


	void insert(int d) {//?????????????´?????????\
        // ???????????????

        Lake c = new Lake(d);
        c.next = dummy.next;
        c.prev = dummy;
        dummy.next.prev = c;
        dummy.next = c;
        tail = dummy.prev;

    }


	void printsum(){

		int i = 0;
		int sum = 0;
		for(Lake end = dummy.next; end!=dummy; end = end.next,i++ ){


			sum += end.depth;


		}


        System.out.println(sum);
        if(0<i ){
        System.out.print(i+" ");
        }else{
        	System.out.print(i);
        }
	}

	void printlist() {//??????????????¨???

		for(Lake end = dummy.next; end!=dummy; end = end.next ){


			System.out.print( end.depth );

			if(end.next != dummy){
				System.out.print( " " );
			}


		}


        System.out.println();

	}

}

Measured memory_bytes: 29392