#include <iostream>
#include <string>
using namespace std ;
 
int main(){
	string a ;
	int test = 1 ;
	while( getline( cin , a) )
	{
		if( a == "#" )
			break ;
		if( a == "" )
		{
			printf( "Tree %d: 0 => 0\n" , test ) ;
			continue ;
		}
		int n = 0 , i = 0 ;
		int b[10002] , visit[10002];
		memset( b , 0 , sizeof(b) ) ;
		memset( visit , 0 , sizeof( visit ) ) ;
		int len = a.size () ;
		int max = 0  ;
		while ( i < len )
		{
			if( a[i] == 'd' )
			{
				n ++ ;
				visit[n] ++ ;
				if( n > max )
					max = n ;
			}
			if( a[i] == 'u')
				n -- ;	
			i ++ ;
		}
		int maxn = 0 ;
		i = 0 , n = 0  ;
		int k = 0 ;
		while( i < len )
		{
			if( a[i] == 'd' )
			{
				k ++ ;
				n ++ ;
				if( k > n )
				{
					n ++ ;
					k = n ;
				}
				b[n] = b[n -1] + 1 ;
				if( b[n] > maxn )
					maxn = b[n] ;
			}
			if( a[i] == 'u')
				n -- ;
			i ++ ;
		}
		printf( "Tree %d: %d => %d\n" , test ++ , max , maxn ) ;
	}
	return 0;
}