A raffle booth's old ticket scanner misreads any printed number containing the digit 0, so the booth never prints a voucher denomination with that digit anywhere in it. Whenever a voucher worth exactly n credits must be split into two smaller vouchers whose credit values add up to n, the booth needs both new denominations to be positive integers with no digit 0 in their decimal representation. Among all such valid splits, the booth always picks the one where the smaller of the two new denominations is as small as possible; once that smallest valid value is fixed, the other denomination is forced, since it must equal n minus the smaller one.

Input format

A single line containing one integer n.

Output format

Print two integers a and b, separated by a single space, such that a + b = n, both a and b are positive integers with no digit 0 anywhere in their decimal representation, a <= b, and a is the smallest value for which such a split is possible.

Constraints

• 2 <= n <= 10000
• It is guaranteed that at least one valid split exists.

11

2 9

1001

2 999