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 a=∑_i=0∞a_i⋅10i, where 0≤a_i≤9, is defined as ∑_i=0∞a_i.
Given an integer n, find two non-negative integers x and y which satisfy the following conditions.
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≤t≤10,000).
Each test case consists of a single integer n (1≤n≤109)
For each test case, print two integers x and y.
If there are multiple answers, print any.