You are to find all pairs of integers such that their sum is equal to the given integer number N and the second number results from the first one by striking out one of its digits. The first integer always has at least two digits and starts with a non-zero digit. The second integer always has one digit less than the first integer and may start with a zero digit.
The input consists of a single integer N (10 ≤ N ≤ 109).
Write the total number of different pairs of integers that satisfy the problem statement. Then write all those pairs. Write one pair on a line in ascending order of
the first integer in the pair. Each pair must be written in the following format:
Here X, Y, and N must be replaced with the corresponding integer numbers. There should
be exactly one space on both sides of '+' and '=' characters.
251 + 51 = 302
275 + 27 = 302
276 + 26 = 302
281 + 21 = 302
301 + 01 = 302
Problem Author: Vladimir Lelyukh, Roman Elizarov
Problem Source: 2001-2002 ACM Northeastern European Regional Programming Contest