Our lovely judge Fofo loves "bitset" very much, and when the judges were discussing the problems to be put in this contest, he sometimes heard the word "bitset" being mentioned.
As he loves "bitset" very much, he usually says his favorite word "7as" when the solution includes "bitset" as a substring$$$^\dagger$$$, and when he does not find "bitset", he gets sad and says "no 7as for you today".
Fofo wants to automate this procedure, so can you help him do that?
$$$\dagger$$$ A string $$$t$$$ is a substring of another string $$$s$$$ if you can obtain $$$t$$$ from $$$s$$$ by deleting (several, maybe $$$0$$$) characters from the beginning of $$$s$$$ and deleting (several, maybe $$$0$$$) characters from the end of $$$s$$$.
Each test consists of multiple test cases. The first line contains a single integer $$$t$$$ $$$(1 \le t \le 100)$$$ — the number of test cases. The description of the test cases follows.
The only line of each test case contains a single string of lowercase English letters $$$s$$$ ($$$1 \le |s| \le 26$$$) — the solution to the problem.
For each test case, print a single line — "7as" if the string contains "bitset", and "no 7as for you today" otherwise (without quotation marks).
6fofolovesbitsetobitsetobitsetobitnosetblueblisteringbarnaclesthearkoffzbitset
7as 7as no 7as for you today no 7as for you today no 7as for you today 7as
