Palindromic Numbers

Description:

Input:

The first line of input data contains an integer $$$t$$$ ($$$1 \leq t \leq 100$$$) — the number of test cases. Next, descriptions of $$$t$$$ test cases follow.

The first line of each test case contains a single integer $$$n$$$ ($$$2 \leq n \leq 100\,000$$$) — the length of the number that is written on the ground.

The second line of contains the positive $$$n$$$-digit integer without leading zeroes — the number itself.

It is guaranteed that the sum of the values $$$n$$$ over all test cases does not exceed $$$100\,000$$$.

Output:

For each of $$$t$$$ test cases print an answer — a positive $$$n$$$-digit integer without leading zeros, such that the sum of the input integer and this number is a palindrome.

We can show that at least one number satisfying the constraints exists. If there are multiple solutions, you can output any of them.

Sample Input:

3
2
99
4
1023
3
385

Sample Output:

32
8646
604

Note:

In the first test case $$$99 + 32 = 131$$$ is a palindrome. Note that another answer is $$$12$$$, because $$$99 + 12 = 111$$$ is also a palindrome.

In the second test case $$$1023 + 8646 = 9669$$$.

In the third test case $$$385 + 604 = 989$$$.