John von Neumann suggested in 1946 a method to create a sequence of
pseudo-random numbers. His idea is known as the "middle-square"-method and works
as follows: We choose an initial value ** a_{0}**, which has a
decimal representation of length at most

Example 1: ** a_{0}**=5555,

Example 2: ** a_{0}**=1111,

Unfortunately, this random number generator is not very good. When started with an initial value it does not produce all other numbers with the same number of digits.

Your task is to check for a given initial value ** a_{0}**
how many different numbers are produced.

The input contains several test cases. Each test case consists of one line containing a0 (0 < a0 < 10000). Numbers are possibly padded with leading zeros such that each number consists of exactly 4 digits. The input is terminated with a line containing the value 0.

For each test case, print a line containing the number of different values ai produced by this random number generator when started with the given value a0. Note that a0 should also be counted.

提交代码