{"trustable":true,"prependHtml":"\u003cstyle type\u003d\"text/css\"\u003e\n #problem-body \u003e pre {\n display: block;\n padding: 9.5px;\n margin: 0 0 10px;\n font-size: 13px;\n line-height: 1.42857143;\n word-break: break-all;\n word-wrap: break-word;\n color: #333;\n background: rgba(255, 255, 255, 0.5);\n border: 1px solid #ccc;\n border-radius: 6px;\n }\n\u003c/style\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv id\u003d\"problem-body\"\u003e\n\t\u003cp\u003eRecently Nabid learn about palindromic string. A regular palindrome is a string of numbers or letters that is the same forward as backward. For example, the string\u0026nbsp;\"ABCDEDCBA\"\u0026nbsp;is a palindrome because it is the same when the string is read from left to right as when the string is read from right to left. Now when he finds a string he tries to make it into a palindromic string by changing character positions. It is simple for him when the string length is small. But not for a large string.\u003c/p\u003e\r\n\u003cp\u003eAs you a Good Programmer Your task is to help Nabid.\u003c/p\u003e\r\n\r\n\u003ch3\u003eInput\u003c/h3\u003e\r\n\u003cp\u003eInput starts with an integer\u0026nbsp;\u003cstrong\u003eT (≤ 25)\u003c/strong\u003e, denoting the number of test cases.\u003c/p\u003e\r\n\u003cp\u003eEach case contains string S length L where 1 \u0026lt;\u003d L \u0026lt;\u003d 10\u003csup\u003e6\u003c/sup\u003e. Assume that all the Characters are in uppercase (A-Z).\u003c/p\u003e\r\n\r\n\u003ch3\u003eOutput\u003c/h3\u003e\r\n\u003cp\u003eFor each case, print the case number and print YES or NO.\u003c/p\u003e\r\n\r\n\u003ch3\u003eExample\u003c/h3\u003e\r\n\u003cdiv\u003e\u003ctable class\u003d\"vjudge_sample\"\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\u003e3\r\nBARID\r\nAAFFG\r\nJARIN\r\n\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eCase 1: NO\r\nCase 2: YES\r\nCase 3: NO\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\u003c/div\u003e\r\n\r\n\u003cp\u003eProblem Setter: Shipu Ahamed, Dept. of CSE\u003cbr\u003e\r\n\u003cem\u003eBangladesh University of Business and Technology (BUBT)\u003c/em\u003e\u003c/p\u003e\r\n\n\u003c/div\u003e"}}]}