PROGRAMMING:Construct palindrome number
Palindrome number is a very interesting number. For a number that is not palindrome number, we can change it into palindrome number by the following operation: invert the number, add it to the original number, and repeat this process until we get palindrome number.
###Input format:
Enter a positive integer with no more than 1000 digits.
###Output format:
For each input, the output turns it into palindrome. Each line is output as follows:
```
A + B = C
```
A is the primitive number, B is the inverse number, and C is the sum. Repeat this process until C is the palindrome number. Output the C is a palindromic number on the last line. In order to control the number of cycles, we specify that if the palindrome number cannot be obtained after 10 operations, stop and display "not found in 10 iterations"```
###Input sample 1:
Here is a set of inputs. For example:
```in
one thousand two hundred and thirty-four
```
###Output sample 1:
The corresponding output is given here. For example:
```out
1234 + 4321 = 5555
5555 is a palindromic number.
```
###Input sample 2:
Here is a set of inputs. For example:
```in
one thousand two hundred and thirty-nine trillion and one hundred and two billion three hundred and forty-nine million one hundred and twenty thousand three hundred and forty-nine
```
###Output sample 2:
The corresponding output is given here. For example:
```out
1239102349120349 + 9430219432019321 = 10669321781139670
10669321781139670 + 07693118712396601 = 18362440493536271
18362440493536271 + 17263539404426381 = 35625979897962652
35625979897962652 + 25626979897952653 = 61252959795915305
61252959795915305 + 50351959795925216 = 111604919591840521
111604919591840521 + 125048195919406111 = 236653115511246632
236653115511246632 + 236642115511356632 = 473295231022603264
473295231022603264 + 462306220132592374 = 935601451155195638
935601451155195638 + 836591551154106539 = 1772193002309302177
1772193002309302177 + 7712039032003912771 = 9484232034313214948
Not found in 10 iterations.
```
answer：If there is no answer, please comment
###Input format:
Enter a positive integer with no more than 1000 digits.
###Output format:
For each input, the output turns it into palindrome. Each line is output as follows:
```
A + B = C
```
A is the primitive number, B is the inverse number, and C is the sum. Repeat this process until C is the palindrome number. Output the C is a palindromic number on the last line. In order to control the number of cycles, we specify that if the palindrome number cannot be obtained after 10 operations, stop and display "not found in 10 iterations"```
###Input sample 1:
Here is a set of inputs. For example:
```in
one thousand two hundred and thirty-four
```
###Output sample 1:
The corresponding output is given here. For example:
```out
1234 + 4321 = 5555
5555 is a palindromic number.
```
###Input sample 2:
Here is a set of inputs. For example:
```in
one thousand two hundred and thirty-nine trillion and one hundred and two billion three hundred and forty-nine million one hundred and twenty thousand three hundred and forty-nine
```
###Output sample 2:
The corresponding output is given here. For example:
```out
1239102349120349 + 9430219432019321 = 10669321781139670
10669321781139670 + 07693118712396601 = 18362440493536271
18362440493536271 + 17263539404426381 = 35625979897962652
35625979897962652 + 25626979897952653 = 61252959795915305
61252959795915305 + 50351959795925216 = 111604919591840521
111604919591840521 + 125048195919406111 = 236653115511246632
236653115511246632 + 236642115511356632 = 473295231022603264
473295231022603264 + 462306220132592374 = 935601451155195638
935601451155195638 + 836591551154106539 = 1772193002309302177
1772193002309302177 + 7712039032003912771 = 9484232034313214948
Not found in 10 iterations.
```
answer：If there is no answer, please comment