小规律（阶乘）

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 ≤ 100 000) — 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.

【题意】

求阶乘后面有m个0的数。

2*5=10；

所以找因子中2和5的个数，因为2小于5，所以有5一定有2，只需要找5的个数即可。

注意最后的输出格式。

#include <iostream>
using namespace std;
typedef long long ll;
const int maxn=1000011;
int a[maxn];//存这个数阶乘后面有多少个0
int b[maxn];//存有m个0的数，最后输出
void init()
{
    int k=0;
    for(int i=5;i<maxn;i++)
    {
        if(i%5==0)
        {
            int t=i;
            while(t%5==0)
            {
                t/=5;
                k++;
            }
        }
        a[i]=k;
    }
}
int main()
{
    ios::sync_with_stdio(false);
    init();
    int m,cnt=0;
    cin>>m;
    for(int i=1;i<maxn;i++)
    {
        if(a[i]==m)
            b[cnt++]=i;
    }
    cout<<cnt<<endl;
    for(int i=0;i<cnt;i++)
        cout<<b[i]<<" ";
    cout<<endl;
    return 0;
}