Problem: Let's define a string <x> as an opening tag, where x is any small letter of the Latin alphabet. Each opening tag matches a closing tag of the type </x>, where x is the same letter.

Tegs can be nested into each other: in this case one opening and closing tag pair is located inside another pair.

Let's define the notion of a XML-text: 

  * an empty string is a XML-text
  * if s is a XML-text, then s'=<a>+s+</a> also is a XML-text, where a is any small Latin letter 
  * if s1, s2 are XML-texts, then s1+s2 also is a XML-text



You are given a XML-text (it is guaranteed that the text is valid), your task is to print in the following form: 

  * each tag (opening and closing) is located on a single line 
  * print before the tag 2 * h spaces, where h is the level of the tag's nestedness. 

Input

The input data consists on the only non-empty string — the XML-text, its length does not exceed 1000 characters. It is guaranteed that the text is valid. The text contains no spaces.

Output

Print the given XML-text according to the above-given rules.

Examples

Input

&lt;a&gt;&lt;b&gt;&lt;c&gt;&lt;/c&gt;&lt;/b&gt;&lt;/a&gt;


Output

&lt;a&gt;
  &lt;b&gt;
    &lt;c&gt;
    &lt;/c&gt;
  &lt;/b&gt;
&lt;/a&gt;


Input

&lt;a&gt;&lt;b&gt;&lt;/b&gt;&lt;d&gt;&lt;c&gt;&lt;/c&gt;&lt;/d&gt;&lt;/a&gt;


Output

&lt;a&gt;
  &lt;b&gt;
  &lt;/b&gt;
  &lt;d&gt;
    &lt;c&gt;
    &lt;/c&gt;
  &lt;/d&gt;
&lt;/a&gt;

Solution (in JAVA):

Solution:
function solve(){
	var str = readline();
	var miniStr = "";
	var strArray = [];
	var cnt = 0;
	var spaces = "";
	var all = "";
	var lettersCnt = 0;
	var slashes = [];
	var angleBr = [];
	var angles = [];
	var rev = false;
	var space = 0;
	var allString = "";
	var op = true;
	var hop = false;
	var fours = 0;
	function printSpaces (space) {
		spaces = "";
		
		for (var j = 0; j < space; j++){
			spaces += " ";	
		}
		return(spaces);
	}
	for (var i = 0; i < str.length; i++){ 
		if (str[i] == ">"){
			angles.push(i);
		}
		if (str[i] == "/"){
			angleBr.push(i+2);	
		}
	}
	//console.log(angles);
	for (var i = 0; i < str.length; i++){

		if (str[i] != ">"){
			miniStr += str[i];	
		}

		if (str[i] == ">"){
			miniStr += ">";
			//console.log(angles[cnt]);
			if (cnt > 0){

				if (angles[cnt]- angles[cnt-1] == 3){

					if (hop == false){
						space+=2;
						//console.log(space + "!");

					}
					if (hop == true){
						hop = false;
						//console.log("111");
					}
					
					
					op = true;
				}
				if (angles[cnt]- angles[cnt-1] == 4){
					if(op == false){
						space-=2;
						//console.log(space + "!!");
					}	
					if(op == true){
						op = false;
						//console.log("222");

					}
					
					hop = true;	
					
				}
			}
			// if (cnt+1 < angles.length){
			// 	if (angles[cnt+1]- angles[cnt] == 3){
			// 		fours = 0;
			// 		if (space != 0) {
			// 			if (hop == false){

			// 				space += 2;
							
			// 			}

			// 		}
			// 		if (hop == true){
			// 			space -=2;
			// 			hop == false;
			// 		}
					
					
			// 		op = true;
			// 	}
			// 	if (angles[cnt+1]- angles[cnt] == 4){
					
			// 		if (op == false){
			// 			space -=2;
			// 			console.log("fours" + op);
			// 		}

			// 		if(op == true) {
			// 			fours++;
			// 			console.log(angles[angles.length-1]);
			// 			if (fours < 2 && (angles[cnt+1] != angles[angles.length-1])){
			// 				space += 2;
			// 				console.log("fours1" + op);

			// 			}

			// 			if ((fours == 2) && (angles[cnt+2] - angles[cnt+1] == 4) ){
			// 				op = false;
							
			// 				console.log("fours2" + op);
			// 			}
						
						
						
			// 		}
			// 		hop = true;
			// 	}
			// }
			
			//console.log(op + "  " + hop + "  " + space);
			spaces = "";
		
			for (var j = 0; j < space; j++){
				spaces += " ";	
			}
			//console.log(spaces);
			allString += spaces;
			allString += miniStr;
			//console.log(allString);
			strArray.push(allString);
			print(allString);
			allString = "";
			miniStr = "";
			cnt++;
		}
		
	}
	
	
	

}



if (typeof DEBUG_ENV_CAN_RUN == "undefined") solve();