There are two ancient stone tablet.
Two strings were written on one ancient stone tablet.
Each string only contains digits with a minus sign at the middle. What's magical is that the string is palindrome.
For example:

91720-02719

Another stone tablet is the key to some buried treasure. It contains two numbers - The results of the two string formulas on the previous tablet.
But what a pity, the palindrome table is missing and an other table is smeared.
For finding the treasure, you should identify the two numbers because the key is the sum of these two numbers.

This problem contains several cases.
Each case has two strings (Longer than 2 but no longer than 9, without leading zero), indicates two smeared numbers. The smeared digit is a '*'. You can consider there's only one '*' in each number.

For each case, you should output the key. You can assume that the key is unque. No zero or nine will be smeared.