Problems
Rare Easy Problem
Rare Easy Problem
n is a random number, which for some reason, is at least two digits. John Doe, a nondescript man, performs an operation on n: he chops off the last digit to form a new number m, and then finds n - m. This excites him in a hard-to-justify way. He then tells you n - m. Thrilled by the fascinating back-story behind this number, you make it your life goal to figure out what n was.
Input data
Input consists of multiple lines, one line per case. Each line contains a single positive integer between 10 and 10^18 inclusive, giving the value of n - m. Input is terminated by a line containing 0.
Output data
For each case, print one line containing the possible values of n in sorted order. Separate consecutive numbers with a single space.
Examples
Input example #1
18 0
Output example #1
19 20