Steganography

In cryptography the goal is to encrypt a message so that, even if it is intercepted, only the intended recipient can read it. In steganography — literally "hidden writing" — the goal is to hide the very fact that a message was sent at all. The technique dates back to at least 440 BC; historical methods include invisible inks and tattooing a message on a messenger's shaved head. A modern method hides a message in the least-significant bits of the RGB color values of the pixels of a digital image.

In this problem you must recover messages hidden inside ordinary-looking text. The spaces in the text encode bits: for each maximal run of consecutive spaces, a run of odd length encodes a 0 and a run of even length encodes a 1. A newline is not a space, so a run of spaces never crosses a line boundary. Reading the runs from left to right and top to bottom produces a single bit string.

The bits are split into groups of five. Each group is a binary number in the range 0–31 and is converted to a character using the table below. If the final group has fewer than five bits, it is padded on the right with 0s.

For example, the five bits $11111_2 = 31_{10}$ decode to ?. When the final group is short it is padded on the right: the two bits 01 become $01000_2 = 8_{10}$, which is H.

The input consists of one or more texts. Each text is made up of one or more lines, each at most 80 characters long, and is terminated by a line containing only a single *. A line containing only a single # marks the end of the input. Apart from spaces, text lines may contain any ASCII letters, digits, or punctuation, except * and #, which appear only as the sentinels described above.

For each text, print the hidden message on its own line. Every hidden message is between 1 and 64 characters long.