Matching Palindrome

아직 제출이 없습니다메모리 제한1024 MB

문제 설명

예제1

문제

You are given a palindrome string $\mathbf{P}$ of length $\mathbf{N}$ consisting of only lowercase letters of the English alphabet. Find the shortest non-empty palindrome string $Q$ such that $\mathbf{P}$ concatenated with $Q$ forms a palindrome. Formally, the string $\mathbf{P}Q$ forms a palindrome.

입력

The first line of the input gives the number of test cases, $\mathbf{T}$ . $\mathbf{T}$ test cases follow. Each test case consists of two lines. The first line of each test case contains an integer $\mathbf{N}$ denoting the length of the string $\mathbf{P}$ . The second line of each test case contains a palindrome string $\mathbf{P}$ of length $\mathbf{N}$ .

출력

For each test case, output one line containing Case #x: y, where $x$ is the test case number (starting from 1) and $y$ is the non-empty palindrome string $Q$ as described above.

제한

$1 \le \mathbf{T} \le 100$ .
String $\mathbf{P}$ is a palindrome consisting of only lowercase letters of the English alphabet.