Problem I. Inverse breaking digits ≡

Author:A. Klenin   Time limit:1 sec
Input file:input.txt   Memory limit:256 Mb
Output file:output.txt  

Statement

Given an integer number A in decimal notation, your program must split it into integers B and C so that:

  1. Every digit of A is encountered exactly once in either B or C.
  2. The sum B + C is minimum possible.
  3. Integers B and C do not contain leading zeroes.

Input file format

Input file contains a single integer A.

Output file format

Output file must contain two integers B and C. If there is more than one solution, output any of them.

Constraints

10 ≤ A ≤ 1018

Sample tests

No. Input file (input.txt) Output file (output.txt)
1 
11
 
1
1
2 
439
 
34
9
3 
1000
 
100
0
0.100s 0.014s 15