{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eJessie has a magic mirror. \u003c/p\u003e\u003cp\u003eEvery morning she will ask the mirror: \u0027Mirror mirror tell me, who is the most beautiful girl in the world?\u0027 If the mirror says her name, she will praise the mirror: \u0027Good guy!\u0027, but if the mirror says the name of another person, she will assail the mirror: \u0027Dare you say that again?\u0027 \u003c/p\u003e\u003cp\u003eToday Jessie asks the mirror the same question above, and you are given a series of mirror\u0027s answers. For each answer, please output Jessie\u0027s response. You can assume that the uppercase or lowercase letters appearing anywhere in the name will have no influence on the answer. For example, \u0027Jessie\u0027 and \u0027jessie\u0027 represent the same person.\u003c/p\u003e\u003ch3\u003eInput\u003c/h3\u003e\u003cp\u003eThe first line contains an integer $T(1 \\le T \\le 100)$, which is the number of test cases.\u003c/p\u003e\u003cp\u003eEach test case contains one line with a single-word name, which contains only English letters. The length of each name is no more than $15$.\u003c/p\u003e\u003ch3\u003eOutput\u003c/h3\u003e\u003cp\u003eFor each test case, output one line containing the answer.\u003c/p\u003e"}},{"title":"Sample 1","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e2\nJessie\nJustin\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eGood guy!\nDare you say that again?\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\u003cbr /\u003e"}}]}