Self-descriptive sentence

Long ago there was a country where only people who studied mathematics lived. Sanggeun and Changyoung, who live there, were arguing about self-descriptive sentences.

A self-descriptive sentence contains exactly one number, and that number equals the count of letters in the sentence. "this sentence has thirtyone letters" and "blah blah seventeen" are two of them.

Sanggeun handed Changyoung a self-descriptive sentence with the number erased. Changyoung wants to put the smallest number into the gap so the sentence is self-descriptive again.

The sentence has the form word1 word2 word3 ... wordN, and one of those words is $. The $ marks where the number goes. For example, Sanggeun turns "this sentence has thirtyone letters" into "this sentence has $ letters" before handing it over.

A number is written by gluing English words together under these rules.

• 1 through 10 are written one, two, three, four, five, six, seven, eight, nine, ten.
• 11 through 19 are written eleven, twelve, thirteen, fourteen, fifteen, sixteen, seventeen, eighteen, nineteen.
• For 20 through 99, write the tens digit and then the ones digit. If the ones digit is 0, write only the tens digit.
• The tens digits 2 through 9 are written twenty, thirty, forty, fifty, sixty, seventy, eighty, ninety.
• For a three digit number, write the hundreds digit and then the remaining two digits. If those two digits are 0, write only the hundreds digit.
• The hundreds digits 1 through 9 are written onehundred, twohundred, threehundred, fourhundred, fivehundred, sixhundred, sevenhundred, eighthundred, ninehundred.
• The answer can always be written with three digits or fewer.

Applying the rules gives these spellings.

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

Only the letters inside the words count. The spaces between words do not.

The first line has N ($1 \le N \le 20$), the number of words in the sentence.

Each of the next N lines has one word. Every word is at most 50 letters long and uses lowercase letters only. No word in the input spells a number.

$ is given exactly once.

Print the finished sentence on the first line. In place of $, write the smallest number that satisfies the condition, and separate the words with a single space. Every input has an answer, and that number is always smaller than 1000.