Problem Statement

You're given $N$ strings $S_1,S_2,\cdots,S_{N-1},S_N$ consisting of lowercase English letters. Determine if these $N$ strings are good.

The definition of good strings:

• Set the string obtained by concatenating these strings to $T$.
• $T$ consisting all of lowercase English letters.
• The length of $T$ is less than or equal $40$.

If these $N$ strings are good, print The quick brown fox jumps over a lazy dog., otherwise print Cwm fjord bank glyphs vext quiz..

Constraints

• $1\leq N\leq 40$, $\forall 1\leq i\leq n,1\leq|S_i|\leq26$.

Sample Input #1

10
abcdef
ghij
klmn
opq
rst
u
v
wxy
z
z

Sample Output #1

The quick brown fox jumps over a lazy dog.

Sample Input #2

2
abcdefg
hijklmnopqrstuvvvxyz

Sample Output #2

Cwm fjord bank glyphs vext quiz.