SP25854 PLNDROME - Palindrome Or Not

``` It's English class now. So John is bored as usual. To get over his boredom he is doing a very strange thing. He writes an arbitrary string on his notebook and then keeps changing a single character of the string every time and tries to find out  if the string has become a palindrome. As John is very smart this task is very simple for him. But how simple is it for you ? Can you be as smart as the great John? You'll have to write a code that solves the similar problem and hopefully as fast as John.   INPUT: First line of the input will be an integer T (T

N/A

N/A