Anti-Greek Debugging

Each Unicode code point is given in the format from U+0000 to U+FFFF.

The Unicode code point of the Greek question mark is U+037E. Therefore, it is enough to check whether any of the $N$ given strings is exactly equal to U+037E.

There is no need to convert the code point into an actual character or parse the hexadecimal value as an integer.

Read each string one by one and remember whether U+037E has appeared. If it appeared at least once, print Greek Question Mark is not allowed. Otherwise, print Good Code.

The time complexity is $O(N)$. Since every string has length $6$, each comparison takes constant time.

The memory complexity is $O(1)$.