Prefix-Suffix Palindrome (Easy version)

题意翻译

给定一个字符串。要求选取他的一个前缀(可以为空)和与该前缀不相交的一个后缀(可以为空)拼接成回文串，且该回文串长度最大。求该最大长度。 多组数据。保证 $\sum n\leq 5000$ 。

题目描述

This is the easy version of the problem. The difference is the constraint on the sum of lengths of strings and the number of test cases. You can make hacks only if you solve all versions of this task. You are given a string $ s $ , consisting of lowercase English letters. Find the longest string, $ t $ , which satisfies the following conditions: - The length of $ t $ does not exceed the length of $ s $ . - $ t $ is a palindrome. - There exists two strings $ a $ and $ b $ (possibly empty), such that $ t = a + b $ ( " $ + $ " represents concatenation), and $ a $ is prefix of $ s $ while $ b $ is suffix of $ s $ .

输入输出格式

输入格式

The input consists of multiple test cases. The first line contains a single integer $ t $ ( $ 1 \leq t \leq 1000 $ ), the number of test cases. The next $ t $ lines each describe a test case. Each test case is a non-empty string $ s $ , consisting of lowercase English letters. It is guaranteed that the sum of lengths of strings over all test cases does not exceed $ 5000 $ .

输出格式

For each test case, print the longest string which satisfies the conditions described above. If there exists multiple possible solutions, print any of them.

输入输出样例

输入样例 #1

5
a
abcdfdcecba
abbaxyzyx
codeforces
acbba

输出样例 #1

a
abcdfdcba
xyzyx
c
abba

说明

In the first test, the string $ s = $ "a" satisfies all conditions. In the second test, the string "abcdfdcba" satisfies all conditions, because: - Its length is $ 9 $ , which does not exceed the length of the string $ s $ , which equals $ 11 $ . - It is a palindrome. - "abcdfdcba" $ = $ "abcdfdc" $ + $ "ba", and "abcdfdc" is a prefix of $ s $ while "ba" is a suffix of $ s $ . It can be proven that there does not exist a longer string which satisfies the conditions. In the fourth test, the string "c" is correct, because "c" $ = $ "c" $ + $ "" and $ a $ or $ b $ can be empty. The other possible solution for this test is "s".