Contests | Virtual Contests | Problems | Submit | Runs Status | Rank List | Forum |

Time Limit: 1.0 Seconds Memory Limit: 65536K

Total Runs: 4653 Accepted Runs: 2073

**Background**

In 1949 the Indian mathematician D.R. Kaprekar discovered a class of numbers called *self-numbers*. For
any positive integer *n*, define *d(n)* to be *n* plus the sum of the digits of *n*. (The *d* stands for *digitadition*, a
term coined by Kaprekar.) For example:

Given any positive integer n as a starting point, you can construct the infinite increasing sequence of integers
*n, d(n), d(d(n)), d(d(d(n))), ...* For example, if you start with 33, the next number is 33 + 3 + 3 = 39,
the next is 39 + 3 + 9 = 51, the next is 51 + 5 + 1 = 57, and so you generate the sequence

The number *n* is called a *generator* of *d(n)*. In the sequence above, 33 is a generator of 39, 39 is a generator
of 51, 51 is a generator of 57, and so on.

Some numbers have more than one generator: For example, 101 has two generators, 91 and 100. A
number with no generators is a *self-number*. There are thirteen self-numbers less than 100: 1, 3, 5, 7, 9, 20,
31, 42, 53, 64, 75, 86, and 97.

**Problem**

Write a program to output all positive self-numbers less than 10000 in increasing order, one per line.

**Input**

There is no input.

**Output**

All positive self-numbers less than 10000 in increasing order, one per line.

Maintance:Fxz. Developer: SuperHacker, G.D.Retop, Fxz