|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||128 MB||24||15||14||70.000%|
For a positive integer number N, find all positive integer numbers X (if any such number exists) with the property that the number 1*2*3*...*X has exactly N decimal digits. Assume that N is at most 150,000.
The standard input has a single line which contains a positive integer number denoting the number N.
Your program should write the output into standard output. The first line should contain the string "NO", if such a number does not exist. Otherwise, the first line should contain a positive integer denoting how many X numbers exist. The next line (until the end of the file) should contain all X numbers found, one number per line.