CF2178A.Yes or Yes

Last Christmas, your friend Fernando gifted you a string $s$ consisting only of the characters $\mathtt{Y}$ and $\mathtt{N}$, representing "Yes" and "No", respectively.

You can repeatedly apply the following operation on $s$:

• Choose any two adjacent characters and replace them with their logical OR.

Formally, in each operation, you can choose an index $i$ ($1 \leq i \leq |s|-1$), remove the characters $s_i$ and $s_{i+1}$, then insert:

• A single $\mathtt{Y}$ if at least one of $s_i$ or $s_{i+1}$ is $\mathtt{Y}$;
• A single $\mathtt{N}$ if both $s_i$ and $s_{i+1}$ are $\mathtt{N}$.

Note that after each operation, the length of $s$ decreases by $1$.

Unfortunately, Fernando does not want you to combine "Yes OR Yes", as he has experienced trauma relating to a certain song.

Determine whether it is possible to reduce $s$ to a single character by repeatedly applying the operation above, without ever combining two $\mathtt{Y}$'s.

去年圣诞节，你的朋友费尔南多送给你一个仅由字符 $\mathtt{Y}$ 和 $\mathtt{N}$ 组成的字符串 $s$，分别代表“是（Yes）”和“否（No）”。

你可以对 $s$ 重复执行以下操作：

• 任选两个相邻字符，并将它们替换为它们的逻辑或（logical OR）。

形式化地说，每次操作中，你可以选择一个下标 $i$（满足 $1 \leq i \leq |s|-1$），删除字符 $s_i$ 和 $s_{i+1}$，然后插入：

• 单个 $\mathtt{Y}$，如果 $s_i$ 或 $s_{i+1}$ 中至少有一个是 $\mathtt{Y}$；
• 单个 $\mathtt{N}$，如果 $s_i$ 和 $s_{i+1}$ 均为 $\mathtt{N}$。

注意：每次操作后，字符串 $s$ 的长度减少 $1$。

不幸的是，费尔南多不希望你将两个 $\mathtt{Y}$ 进行组合（即执行“是 OR 是”），因为他曾因某首特定歌曲而遭受过心理创伤。

请判断：能否通过反复执行上述操作，将 $s$ 化简为单个字符，且在过程中从未将两个 $\mathtt{Y}$ 组合在一起？

Each test contains multiple test cases. The first line contains the number of test cases $t$ ($1 \le t \le 500$). The description of the test cases follows.

The only line of each test case contains the string $s$ ($2\le |s|\le 100$). It is guaranteed that $s_i = \mathtt{Y}$ or $\mathtt{N}$.

每个测试包含多个测试用例。第一行包含测试用例的数量 $t$（$1 \le t \le 500$）。随后是测试用例的描述。

每个测试用例仅有一行，包含字符串 $s$（$2\le |s|\le 100$）。保证字符串中每个字符 $s_i$ 为 $\mathtt{Y}$ 或 $\mathtt{N}$。

For each test case, print "YES" if the string can be reduced to a single character by repeatedly applying the described operation, and "NO" otherwise.

You can output the answer in any case (upper or lower). For example, the strings "yEs", "yes", "Yes", and "YES" will be recognized as positive responses.

对于每个测试用例，如果该字符串能通过重复应用上述操作缩减为单个字符，则输出 “YES”；否则输出 “NO”。

你可以以任意大小写形式输出答案（大写或小写均可）。例如，字符串 “yEs”、“yes”、“Yes” 和 “YES” 均被视为肯定回答。

In the first test case, you cannot combine $s_1$ and $s_2$ since they are both $\mathtt{Y}$. Thus, the answer is NO.

In the third test case, the following is a valid sequence of operations: $\mathtt{\underline{NN}Y}\to\mathtt{\underline{NY}}\to\mathtt{Y}$. Thus, the answer is YES.

In the fourth test case, there are two possibilities for the first operation: $\mathtt{YY\underline{YN}Y}\to \mathtt{YYYY}$ or $\mathtt{YYY\underline{NY}}\to \mathtt{YYYY}$. However, in either case, it is not possible to perform any more operations without combining two $\mathtt{Y}$'s. Thus, the answer is NO.

In the fifth test case, the following is a valid sequence of operations: $\mathtt{N\underline{NN}NN}\to\mathtt{\underline{NN}NN}\to\mathtt{N\underline{NN}}\to\mathtt{\underline{NN}}\to\mathtt{N}$. Thus, the answer is YES.

在第一个测试用例中，你无法合并 $s_1$ 和 $s_2$，因为它们均为 $\mathtt{Y}$。因此，答案为 NO。

在第三个测试用例中，以下是一组合法的操作序列：$\mathtt{\underline{NN}Y}\to\mathtt{\underline{NY}}\to\mathtt{Y}$。因此，答案为 YES。

在第四个测试用例中，第一次操作有两种可能：$\mathtt{YY\underline{YN}Y}\to \mathtt{YYYY}$ 或 $\mathtt{YYY\underline{NY}}\to \mathtt{YYYY}$。然而，无论哪种情况，后续都无法再执行任何操作而不合并两个 $\mathtt{Y}$。因此，答案为 NO。

在第五个测试用例中，以下是一组合法的操作序列：$\mathtt{N\underline{NN}NN}\to\mathtt{\underline{NN}NN}\to\mathtt{N\underline{NN}}\to\mathtt{\underline{NN}}\to\mathtt{N}$。因此，答案为 YES。