F. We Want a Lesson
time limit per test
1 second
memory limit per test
1024 megabytes
input
standard input
output
standard output

Legend says that there was a coach at DCPC named Jaber. His account was new on all competitive programming sites because he camouflaged himself, but he was a very smart and kind person.

One of the ways he used to camouflage himself is that when someone achieved something, he said to them, "BdnaDars".

Coach Yaman developed a strategy to prevent Jaber from saying that phrase in the future. The strategy says that when Jaber says, "BdnaDars" we respond with "Enough!" and otherwise we respond with "OK".

Now Jaber wants to talk to you. Use Yaman's strategy by responding to him.

Input

The first line of the input contains one integer $$$n$$$ $$$( 1 \le n \le 10^{3} )$$$ — the number of phrases that Coach Jaber will say to you.

Each of the next $$$n$$$ lines contains one string $$$s_i$$$ $$$( 1 \le | s_i | \le 100)$$$ — the phrase of the $$$i$$$-th request. It's guaranteed that the string has only alphabet letters.

Output

For each phrase that Coach Jaber will say to you, print "Enough!" (without quotes), or print "OK" (without quotes), depending on Yaman's strategy.

Example
Input
2
Hi
BdnaDars
Output
OK
Enough!