C. Coruñese Numbers
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

We say that a number is coruñese if, in its decimal representation, there are no two consecutive digits that are the same.

Given $$$n$$$, express $$$n$$$ as the sum of two non-negative coruñese integers.

Input

The first line contains an integer $$$T$$$, the number of cases to process.

This is followed by $$$T$$$ lines, each containing an integer $$$n$$$.

Output

For each case, write a line with two coruñese numbers $$$a$$$ and $$$b$$$, such that $$$a + b = n$$$. The numbers $$$a$$$ and $$$b$$$ must be written in decimal without leading zeros. You can print any valid solution.

Scoring
  1. (13 points) The sum of $$$n$$$ for all cases is at most $$$10^6$$$.
  2. (29 points) $$$n \lt 10^9$$$.
  3. (25 points) All digits of $$$n$$$ are the same.
  4. (33 points) No additional restrictions.
Example
Input
5
1
11
2
2025
1337
Output
0 1
6 5
1 1
2020 5
1216 121
Note

$$$1 \leq T \leq 10^4$$$.

$$$1 \leq n \lt 10^{10^5}$$$, and the sum of the number of digits of $$$n$$$ for all cases will be at most $$$10^5$$$.