A. An Unfortunate Coincidence
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

SnowballSH really enjoyed his time at Whitney M. Young Magnet High School, so much that he often wears his Whitney Young Math Team merch even at Carnegie Mellon University.

Unfortunately, the letters "WY" on these shirts and jackets could refer to both Whitney Young and the state of Wyoming. As a result, many people have come up to SnowballSH and asked him if he is from Wyoming.

To solve this problem, SnowballSH wishes to create a program that, when given a list of $$$n$$$ words, automatically converts all instances of "WY" to "Whitney Young". Can you help him?

Input

The first line contains a single integer $$$n$$$ $$$(1 \le n \le 2025)$$$ — the number of words.

Then, $$$n$$$ lines follow. The $$$i$$$-th line contains a string $$$s_i$$$ $$$(1 \le |s_i| \le 67)$$$ — the $$$i$$$-th word.

It is guaranteed that for all $$$i=1,2,\dots,n$$$, $$$s_i$$$ contains only lowercase and uppercase Latin alphabets.

Output

For each of the $$$n$$$ words, on a separate line, output Whitney Young if $$$s_i = $$$ WY (case-sensitive). Otherwise, output $$$s_i$$$ as it is.

Example
Input
9
I
miss
WY
Math
Team
and
WY
Coding
Club
Output
I
miss
Whitney Young
Math
Team
and
Whitney Young
Coding
Club