SubString

<p> You are given a string input.You are to find the longest substring of input such that the&nbsp;reversal of the substring is also a </p> <p> substring of input.In case of a tie,return the string that&nbsp;occurs earliest in input. </p> <p> Note well:The substring and its reversal may overlap partially or completely.The entire original string is itself a valid </p> <p> substring.The best we can do is find a one character substring,so we implement the tie-breaker rule of taking the earliest </p> <p> one first. </p>

The first line of input gives a single integer,1&lt;=N&lt;=10,the num of test cases.<br /> <p> Then follow,for each test case,a line containing between 1 and 50 characters,inclusive. </p> <p> Each character of input will be an uppercase letter('A'-'Z'). </p>

Output for each test case the longer substring of input such that the reversal of the substring is&nbsp;also a substring of input.<br />