奥数战场

       奥数战场，是龙华大陆一处异域战场，里面有无数天魔，是由各种各样的数学算式构成的一种无意识思想狂暴的天魔，这种天魔是专门破坏龙华大陆与魔界的结界的。所以，每年都会有无数的小学生，初中生，高中生被守护龙华大陆的奥林匹克权威机构招去和里面的无数天魔厮杀。
       这其中，杀的天魔越多，得到的功勋越多，奥林匹克便会颁发一些灵器级别的证书，当然，假若在同级修为之中，得到的功勋越多，奥林匹克便会颁发第一名的上品灵器级别的奥数证书♀样的证书得到以后，可谓又是多了一条生命。若是一个六年级的强者去渡小升初的天劫的时候，只要他有第一名的奥数证书，就可以拿着奥数证书，请任何一个重点初中初一年级的强者为自己护法，有初中生的护法，小学生度过小升初天劫便会有八成的成功几率。可谓是不用渡过天劫，就可以直接成为初中生了。
       其他优秀证书，除了二三名可以请一般学校初中生护法，后其后四名到前一百得到的优秀证书就只能够在度过天劫的时候抗下一击或者两击小天劫，危险系数只是比其他没有证书的六年级强者少了那么几分。
       而奥利匹克这样一个超然于大陆之上的势力颁发的证书，是每一个学校都认可的，每一个初中生见到这种证书的时候，都必须无条件遵守的答应这个六年级强者的请求。当然，初中生答应帮助这些六年级强者度过天劫之后，那证书也必须交给初中生，初中生收集满三个这样的证书之后，可以的再一次参加奥数战场的机会。
       毕竟，奥数战场多参加几次，也是磨练自己的修为，运气不错的话，得到第一名的时候，也可以请一个重点高中的高中生为自己护法。
       所以，基于这样的原因，每年四月，当奥数战场开发的时刻，就会吸引来自全龙华大陆的小学生，初中生，高中生等到奥数战场厮杀天魔，获取他们梦寐以求的证书。
       平儿来到了奥数战场，遇到了一头和他战斗力差不多的天魔，天魔发出一声厉啸，许多英文飘了出来。
       In cryptography, the goal is to encrypt a message so that, even if the the message is intercepted, only the intended recipient can decrypt it. In steganography, which literally means "hidden writing", the goal is to hide
the fact that a message has even been sent. It has been in use since 440 BC. Historical methods of steganography include invisible inks and tatooing messages on messengers where they can't easily be seen. A modern method is to encode a message using the least-significant bits of the RGB color values of pixels in a digital image.
For this problem you will uncover messages hidden in plain text. The spaces within the text encode bits; an odd number of consecutive spaces encodes a 0 and an even number of consecutive spaces encodes a 1. The
four texts in the example input below (terminated by asterisks) encode the following bit strings: 11111, 000010001101101, 01, and 000100010100010011111. Each group of five consecutive bits represents a
binary number in the range 0 - 31, which is converted to a character according to the table below. If the last group contains fewer than five bits, it is padded on the right with 0's.
" " (space) 0
"A" - "Z" 1 - 26
"'" (apostrophe) 27
"," (comma) 28
"-" (hyphen) 29
"." (period) 30
"?" (question mark) 31
The first message is 11111 ₂ = 31 ₁₀ = "?". The second message is (00001, 00011, 01101) ₂ = (1, 3, 13) ₁₀ =
"ACM". The third message is 01000 ₂ = 8 ₁₀ = "H", where the underlined 0's are padding bits. The fourth message is (00010, 00101, 00010, 01111, 10000) ₂ = (2, 5, 2, 15, 16) ₁₀ = "BEBOP".

The input consists of one or more texts. Each text contains one or more lines, each of length at most 80 characters, followed by a line containing only "*" (an asterisk) that signals the end of the text. A line containing only "#" signals the end of the input. In addition to spaces, text lines may contain any ASCII letters, digits, or punctuation, except for "*" and "#", which are used only as sentinels.

For each input text, output the hidden message on a line by itself. Hidden messages will be 1 - 64 characters long.
Note: Input text lines and output message lines conform to all of the whitespace rules listed in item 7 of Notes to Teams except that there may be consecutive spaces within a line. There will be no spaces at the beginning or end of a line.