Input a string s, which contains at least one "tou'' substring. If the front part of a tou substring is equal to the rear part of the tou substring, output "feihua'', otherwise output "yunle''.
输入格式
The first line contains a number $T(1\le T\le100)$, which describes the number of strings.
Next $T$ lines, each line contains a string $s$, not more than 100 in length. ($4\le length(s)\le 100$)
输出格式
If there is a "tou'' substring whose first part is equal to the last part of the "tou'' substring, output "feihua'', otherwise output "yunle''.
