P6509 [COCI2007-2008] JEDNAKOST

You are given a string of the form `A=B`, where both $A$ and $B$ are positive integers with no leading zeros. Insert plus signs between some adjacent digits of $A$. The goal is to use as few plus signs as possible so that the equation becomes true. After inserting plus signs into $A$, each addend is allowed to have multiple leading zeros, including $0$. That is, numbers of the form $000 \ldots$ are allowed as addends. The testdata guarantees that a solution exists.

The input consists of a single line containing a string of the form `A=B`, representing the given equation.

**This problem has a Special Judge.** Output one line containing a string representing a valid equation after inserting plus signs.

#### Constraints For all test cases, it is guaranteed that $1 \leq A \lt 10^{1000}$, $1 \leq B \leq 5 \times 10^3$, and $A \neq B$. #### Notes **Translated from [COCI2007-2008](https://hsin.hr/coci/archive/2007_2008/) [Regional Competition](https://hsin.hr/coci/archive/2007_2008/regional_tasks.pdf) *T4 JEDNAKOST***。 Translated by ChatGPT 5