Crypt Kicker II

A common but insecure way to encrypt text is to permute the letters of the alphabet: in the message, every occurrence of a given letter is consistently replaced by one other fixed letter. Because the substitution must be reversible, no two different letters are ever replaced by the same letter (the substitution is a one-to-one mapping of the 26 lowercase letters onto themselves).

A classic way to break such a cipher is the known-plaintext attack: the attacker obtains the encrypted form of a phrase whose plaintext is already known, and from the pairing of ciphertext and plaintext deduces the substitution.

You are given several encrypted lines, all produced with the same substitution. One of the lines is the encryption of the plaintext

the quick brown fox jumps over the lazy dog

Because this sentence is a pangram (it uses all 26 letters), matching it against its encryption fixes the entire substitution table. Use that table to decrypt every input line.

The input consists of several lines. Each encrypted line contains only lowercase letters and spaces and is at most 80 characters long. There are at most 100 lines. Input ends at end of file.

For every input line, print its decryption on its own line, using the substitution deduced from the known plaintext. Because the plaintext is a pangram, the substitution table, and therefore the decryption, is uniquely determined.

If no input line can be the encryption of the known plaintext (no consistent substitution exists), print a single line:

No solution.