Nakov is keen football fаn and he is passionate about the upcoming FIFA World Cup tournament. A month before the tournament Nakov started his preparations with a few stacks of beer and a few single beer bottles. You are given a list of Nakov's stacks and Nakov's single beers. Help him to count how many stacks of beer and how many additional single bottles he has for the tournament. Assume that a stack of beer holds 20 beers.
The input comes from the console as list of beers and stacks of beer, each at a single line, ending with the text "End" at the last line. Each line (except the last) come in format "count measure" where count is a positive integer and measure is either "stacks" or "beers" (see the examples below).
The input data will always be valid and in the format described. There is no need to check it explicitly.
Print at the console the total number of stacks and the number of single beers that Nakov has in the following format: "x stacks + y beers", where x is an integer number and y is an integer number, less than 20.
The count will be an integer number in the range [1…99].
The measure is either "stacks" or "beers".
The number of input lines will be in the range [1..999].
Time limit: 0.3 sec. Memory limit: 16 MB.