Введение АиСД. (1 курс)

Problem A. Add one ≡

problems
visible spaces
basic formulae
wide text
editor

Author:	A. Klenin	Time limit:	1 sec
Input file:	input.txt	Memory limit:	64 Mb
Output file:	output.txt

Statement

Your task is the most trivial one: given non-negative integer N, output N + 1.

The only complication is that the integer is given in an unknown base between 2 and 36 inclusive. Because of that, your program should output all possible distinct answers in lexicographically increasing order.

Input file format

Input file contains integer N composed of digits from 0 to 9 and latin capital letters from A to Z, without leading zeroes.

Output file format

Output file must contain all possible distinct answers, one per line. Answers must be output in the same format as input.

Constraints

N contains from 1 to 100 digits

Sample tests

No.	Input file (`input.txt`)	Output file (`output.txt`)
1	`32`	`33`
2	`9`	`10 A`