A Trivial Problem

题意翻译

## 题目描述 圣塔先生要求世界上所有伟大的程序员解决一个小问题。他给了他们一个整数m,并要求正整数n的个数当n的阶乘恰好以m个0结束。您是能够解决这个问题的优秀程序员之一吗? ### 输入格式: 输入的唯一一行包含一个整数m (1<=m<=100000)代表阶乘中所需的尾随零的数量。 ### 输出格式 如果可以,输出一个整数k代表n的数量,接下来是k个n;如果不可以,输出0。

题目描述

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?

输入输出格式

输入格式


The only line of input contains an integer $ m $ ( $ 1<=m<=100000 $ ) — the required number of trailing zeroes in factorial.

输出格式


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.

输入输出样例

输入样例 #1

1

输出样例 #1

5
5 6 7 8 9 

输入样例 #2

5

输出样例 #2

0

说明

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 $ .