Preparing NOJ

A correct expression of the form a+b=c was written; *a*, *b* and *c* are non-negative integers without leading zeros. In this expression, the plus and equally signs were lost. The task is to restore the expression. In other words, one character '+' and one character '=' should be inserted into given sequence of digits so that:

- character'+' is placed on the left of character '=',
- characters '+' and '=' split the sequence into three non-empty subsequences consisting of digits (let's call the left part a, the middle part — b and the right part — c),
- all the three parts a, b and c do not contain leading zeros,
- it is true that a+b=c.

It is guaranteed that in given tests answer always exists.

The first line contains a non-empty string consisting of digits. The length of the string does not exceed 10^{6}.

Output the restored expression. If there are several solutions, you can print any of them.

Note that the answer at first should contain two terms (divided with symbol '+'), and then the result of their addition, before which symbol'=' should be.

Do not separate numbers and operation signs with spaces. Strictly follow the output format given in the examples.

If you remove symbol '+' and symbol '=' from answer string you should get a string, same as string from the input data.

12345168

123+45=168

099

0+9=9

199100

1+99=100

123123123456456456579579579

123123123+456456456=579579579

Info

Provider CodeForces

Origin Codeforces Round #451 (Div. 2)

Code CF898F

Tags

brute forcehashingmath

Submitted 50

Passed 28

AC Rate 56%

Date 03/04/2019 16:11:46

Related