{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\r\n \u003cdiv\u003e\r\n XadillaX likes to play with strings very much.\u003cbr\u003e\nHis favorite string is palindrome. Once he come across with a string, XadillaX always wants to change it to a palindrome by resorting the letters.\u003cbr\u003e\n\u003cbr\u003e\nNow give you a string, you should tell him whether the string can be changed to a palindrome. If yes, you should output it. (The smallest one in Lexicographic order)\u003cbr\u003e\n\u003cdiv style\u003d\"white-space:nowrap;\"\u003e\n\t\u003cbr\u003e\n\u003c/div\u003e \u003c/div\u003e\r\n "}},{"title":"Input","value":{"format":"HTML","content":"\r\n \u003cdiv\u003e\r\n This problem contains several cases.\u003cbr\u003eEach case is a string, no longer than 20000. Only contains uppercase letters.\u003cbr\u003e \u003c/div\u003e\r\n "}},{"title":"Output","value":{"format":"HTML","content":"\r\n \u003cdiv\u003e\r\n For each case, if it can be changed to a palindrome, output it. If can\u0027t, output 0.\u003cbr\u003e \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\u003eFJSDAKL\nABCDECDAB\n\u003c/pre\u003e\r\n \u003c/td\u003e\n \u003ctd\u003e\r\n \u003cpre\u003e0\nABCDEDCBA\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 "}}]}