27488번 - Sum of Two Numbers 스페셜 저지다국어

문제

The sum of digits of a non-negative integer $a$ is the result of summing up its digits together when written in the decimal system. For example, the sum of digits of 123ドル$ is 6ドル$ and the sum of digits of 10ドル$ is 1ドル$.

In a formal way, the sum of digits of $\displaystyle a=\sum_{i=0}^{\infty} a_i \cdot 10^i,ドル where 0ドル \leq a_i \leq 9,ドル is defined as $\displaystyle\sum_{i=0}^{\infty}{a_i}$.

Given an integer $n,ドル find two non-negative integers $x$ and $y$ which satisfy the following conditions.

• $x+y=n,ドル and
• The sum of digits of $x$ and the sum of digits of $y$ differ by at most 1ドル$.

It can be shown that such $x$ and $y$ always exist.

입력

Each test contains multiple test cases. The first line contains the number of test cases $t$ (1ドル \le t \le 10,000円$).

Each test case consists of a single integer $n$ (1ドル \leq n \leq 10^9$)

출력

For each test case, print two integers $x$ and $y$.

If there are multiple answers, print any.

제한

힌트