Source

This problem is adapted from Long Long OJ. All rights reserved.

Problem Description

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..

Input Format

The first line consists of an integer $N\ (1 \le N \le 40)$.

$N$ lines consisting of a string $S_i\ (1 \le |S_i| \le 26)$ with lowercase English letters respectively follow.

Output Format

One line consisting of the string The quick brown fox jumps over a lazy dog. or Cwm fjord bank glyphs vext quiz..

Samples

10
abcdef
ghij
klmn
opq
rst
u
v
wxy
z
z

The quick brown fox jumps over a lazy dog.

2
abcdefg
hijklmnopqrstuvvvxyz

Cwm fjord bank glyphs vext quiz.