{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\r\n \u003cdiv\u003e\r\n \u003cspan\u003e\u003cspan\u003eThe problem is pretty easy, giving you a very long string, you have to find the first longest palindrome in the string. (\u003c/span\u003e\u003cstrong\u003e\u003cem\u003e\u003cspan style\u003d\"color:#E53333;\"\u003eCase-insensitive\u003c/span\u003e\u003c/em\u003e\u003c/strong\u003e\u003cstrong\u003e\u003cem\u003e\u003cspan style\u003d\"color:#E53333;\"\u003e\u003c/span\u003e\u003c/em\u003e\u003c/strong\u003e\u003cspan\u003e)\u003c/span\u003e\u003c/span\u003e \u003c/div\u003e\r\n "}},{"title":"Input","value":{"format":"HTML","content":"\r\n \u003cdiv\u003e\r\n First line contain a integer T (T \u0026lt;\u003d 100), means the test case.\u003cbr\u003eAnd the following T lines, for each line, there is a string is make up with the uppercase and lowercase.\u003cbr\u003eThe string\u0027s length is less than 10000.\u003cbr\u003e \u003c/div\u003e\r\n "}},{"title":"Output","value":{"format":"HTML","content":"\r\n \u003cdiv\u003e\r\n For each test case, you should print the longest palindrome, if there are muti-case, print first of them. \u003c/div\u003e\r\n "}},{"title":"Sample","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\r\n \u003cpre\u003e3\naaa\naa\nAdad\u003c/pre\u003e\r\n \u003c/td\u003e\n \u003ctd\u003e\r\n \u003cpre\u003eaaa\naa\nAda\n\u003c/pre\u003e\r\n \u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Hint","value":{"format":"HTML","content":"\r\n \u003cpre\u003e无\u003c/pre\u003e\r\n "}}]}