{"raw_statement":[{"iden":"problem statement","content":"Given are positive integers $a, b$, where none of the digits is $0$.\nPermute the digits of each of $a$ and $b$ so that the sum of the digits in $a+b$ is minimized."},{"iden":"constraints","content":"*   $1\\leq a, b< 10^{100000}$\n*   None of the digits of $a$ and $b$ is $0$."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$a$\n$b$"},{"iden":"sample input 1","content":"253\n286"},{"iden":"sample output 1","content":"532\n268\n\nWe have $532 + 268 = 800$, whole digits sum to $8+0+0=8$.\nOther solutions will also be accepted, such as $(a, b) = (325, 682)$."},{"iden":"sample input 2","content":"345\n556"},{"iden":"sample output 2","content":"435\n565\n\nWe have $435+565=1000$, whole digits sum to $1+0+0+0=1$."},{"iden":"sample input 3","content":"123\n987987"},{"iden":"sample output 3","content":"312\n799788\n\nWe have $312 + 799788 = 800100$, whole digits sum to $8+0+0+1+0+0=9$."},{"iden":"sample input 4","content":"11111111111111111111\n111111111111111111111111111111"},{"iden":"sample output 4","content":"11111111111111111111\n111111111111111111111111111111"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}