28202번 - Classical A+B Problem 스페셜 저지다국어

문제

An integer is called a repdigit if it is positive and its decimal representation consists of repeated instances of the same digit. For example, 1ドル,ドル 666ドル,ドル 4444ドル,ドル and 999999ドル$ are repdigits, while 0ドル,ドル 44244ドル,ドル 50216ドル,ドル and 787788ドル$ are not.

You are given a positive integer $n$. It is known that $n$ can be represented as $n = a + b,ドル where $a$ and $b$ are repdigits. Find any such representation.

입력

Each test contains multiple test cases. The first line contains the number of test cases $t$ (1ドル \le t \le 10^4$). The description of the test cases follows.

The only line of each test case contains a single integer $n$ without leading zeros (2ドル \le n < 10^{4000}$). It is guaranteed that $n$ can be represented as $n = a + b,ドル where $a$ and $b$ are repdigits.

It is guaranteed that the total number of digits in $n$ over all test cases does not exceed 10ドル^5$.

출력

For each test case, print two integers $a$ and $b$ such that $n = a + b$ and both $a$ and $b$ are repdigits.

If there are multiple solutions, print any of them.

제한

힌트