跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1337. A Trivial Problem

    ID: 1343 传统题 2000ms 256MiB 尝试: 0 已通过: 0 难度: 3 上传者: 标签>枚举构造数学数论算法思想基础难度共享题库Codeforces英文题面题目来源题面语言

A Trivial Problem

题目描述

B. A Trivial Problem
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Mr. Santa asks all the great programmers of the world to solve a trivial problem. He gives them an integer m and asks for the number of positive integers n, such that the factorial of n ends with exactly m zeroes. Are you among those great programmers who can solve this problem?

Input

The only line of input contains an integer m (1≤m≤100000)− the required number of trailing zeroes in factorial.

Output

First print k− the number of values of n such that the factorial of n ends with m zeroes. Then print these k integers in increasing order.

Examples
Input
1
Output
5
5 6 7 8 9
Input
5
Output
0
Note

The factorial of n is equal to the product of all integers from 1 to n inclusive, that is n!=1·2·3·...·n.

In the first sample, 5!=120, 6!=720, 7!=5040, 8!=40320 and 9!=362880.

题目来源：fps-www.educg.net-codeforce-1-2833.xml.zip；FPS 共享题包，题包内第 835 题。保留原作者与原赛事署名。