[요약] $가 포함된 문장이 주어지면 $에 수를 넣어서 총 글자 수(공백 제외)가 그 수가 되게 하여라.

예를 들어, this sentence has thirtyone letters 에 있는 글자 수는 31개(thirtyone)이다. 답이 여러 개이면 가장 작은 수를 넣어야 합니다.

Little Jurica overheard his friends' conversation and decided to impress them with the amount of selfexplanatory sentences he knows by heart. He rushed back home and wrote a programme which will, given a sentence, tell him the minimum number he can put inside so that the sentence is valid. Unfortunately, his computer broke and now he needs your help. Write a programme to help Jurica!

The form of the sentence is: word1 word2 word3 … $ word_n-1 word_n. The character $ represents the place where the number should be put in.

For example, the form of the sentence “this sentence has thirtyone letters” would be “this sentence has $ letters”. The rules that apply to writing numbers are the following:

• numbers from 1 to 10 are written “one”, “two”, “three”, “four”, “five”, “six”, “seven”, “eight”, “nine”, “ten”, respectively
• numbers from 11 to 19 are written “eleven”, “twelve”, “thirteen”, “fourteen”, “fifteen”, “sixteen”, “seventeen”, “eighteen”, “nineteen”
• the remaining double digit numbers are written in a way that we name the tens' digit and add to it the name of the one digit remaining when we remove the tens' digit. Specially, if by removing the tens' digit we remain with zero, we add nothing to it
• the tens' digits (respectively from 2 to 9) are named the following: “twenty”, “thirty”, “forty”, “fifty”, “sixty”, “seventy”, “eighty”, “ninety”
• three digit numbers are written in a way that we name the hundreds' digit number and add to it the number of the double digit number remaining. Specially, if by removing the hundreds' digit we remain with zero, we add nothing to it
• the hundreds' digits (respectively from 1 to 9) are named the following: “onehundred”, “twohundred”, “threehundred”, “fourhundred”, “fivehundred”, “sixhundred”, “sevenhundred”, “eighthundred”, “ninehundred”
• the rules that apply for numbers with more than three digits are not relevant because the input data will always be such that the output is less than a thousand

• 68 = “sixty” + “eight” = “sixtyeight”
• 319 = “threehundred” + “nineteen” = “threehundrednineteen”
• 530 = “fivehundred” + “thirty” = “fivehundredthirty”
• 971 = “ninehundred” + “seventy” + “one” = “ninehundredseventyone”

입력

• The first line of input contains the integer N (1 ≤ N ≤ 20), the number of words in the sentence.
• Each of the following N lines contains a word not longer than 50 lowercase letters of the English alphabet or the character $ (none of the words will be the name of a number). The character $ will appear exactly once.

출력

The input data will be such that a solution will always exist and is less than 1000.

입출력 예

input

5
this
sentence
has
$
letters

output

this sentence has
thirtyone letters

input

7
$
is
the
number
of
letters
here

output

thirty is the number
of letters here

input

5
the
letters
are
$
potato

output

the
letters
are
twentynine
potato

Clarification of the second example: Sentence is split in two lines because of the lack of space in the
table. The total number of letters in the sentence is 6 + 2 + 3 + 6 + 2 + 7 + 4 = 30
Clarification of the third example: As you can see, this sentence is gramatically incorrect.
Nevertheless, Jurica is not concerned by that, for he is a mathematician, not a linguist.

출처:coci/2013-2014/contest3 3/6
요약:Cauchy