Time Limit: Java: 2000 ms / Others: 2000 ms

Memory Limit: Java: 65536 KB / Others: 65536 KB

Statement of the Problem

We say that a number is a palindrom if it is the sane when read from left to right or from right to left. For example, the number 75457 is a palindrom.

Of course, the property depends on the basis in which is number is represented. The number 17 is not a palindrom in base 10, but its representation in base 2 (10001) is a palindrom.

The objective of this problem is to verify if a set of given numbers are palindroms
in any basis from 2 to 16.

Several integer numbers comprise the input. Each number 0 < n < 50000
is given in decimal basis in a separate line. The input ends with a zero.

Your program must print the message Number i is palindrom in basis where I
is the given number, followed by the basis where the representation of the number
is a palindrom. If the number is not a palindrom in any basis between 2 and
16, your program must print the message Number i is not palindrom.

提交代码