11-3. 50969 - Chef and Feedback

Chef and Feedback

Many geeky customers visit our chef's restaurant every day. Therefore, when asked to fill the feedback form, these customers represent the feedback using a binary string (i.e. a string that contains only characters '0' and '1').

Now since chef is not that great in deciphering binary strings, he has decided the following criteria to classify the feedback as Good or Bad :

If the string contains the substring "010" or "101", then the feedback is Good, else it is Bad. Note that, to be Good it is not necessary to have both of them as substring.

So given some binary strings, you need to output whether according to the chef, the strings are Good or Bad.

Input

The first line contains an integer T denoting the number of feedbacks. Each of the next T lines contains a string composed of only '0' and '1'.

Output

For every test case, print in a single line Good or Bad as per the Chef's method of classification.

Constraints

• 1 ≤ T ≤ 100
• 1 ≤ |S| ≤ 10⁵

Sum of length of all strings in one test file will not exceed 6*10⁶.

Sample Input1:	Sample Input2:
2 11111110 10101010101010	3 110110110 001001 101010
Sample Output1:	Sample Output2:
Bad Good	Good Good Good

 

 

 

 

 

 

 

Explanation of Sample 1:

Case 1 (11111110)               : The string does not contain 010 or 101 as substrings.
Case 2 (10101010101010) : The string contains both 010 and 101 as substrings.