Sum of Two Numbers

아직 제출이 없습니다시간 제한1초메모리 제한1024 MB

문제

The sum of digits of a non-negative integer aa is the result of summing up its digits together when written in the decimal system. For example, the sum of digits of 123123 is 66 and the sum of digits of 1010 is 11.

In a formal way, the sum of digits of a=_i=0a_i10i\displaystyle a=\sum\_{i=0}^{\infty} a\_i \cdot 10^i, where 0a_i90 \leq a\_i \leq 9, is defined as _i=0a_i\displaystyle\sum\_{i=0}^{\infty}{a\_i}.

Given an integer nn, find two non-negative integers xx and yy which satisfy the following conditions.

  • x+y=nx+y=n, and
  • The sum of digits of xx and the sum of digits of yy differ by at most 11.

It can be shown that such xx and yy always exist.

입력

Each test contains multiple test cases. The first line contains the number of test cases tt (1t10,0001 \le t \le 10\\,000).

Each test case consists of a single integer nn (1n1091 \leq n \leq 10^9)

출력

For each test case, print two integers xx and yy.

If there are multiple answers, print any.