CodeForces 633B A Trivial Problem

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的数有哪些，即求n的阶乘中有多少个5；

#include<stdio.h>
#include<algorithm>
#include<iostream>
#include<string.h>
#include<math.h>
#include<map>
using namespace std;
typedef long long ll;
#define mod 1000000007
ll power(ll a,ll b,ll p)
{
    ll ans=1%p;
    for(; b; b>>=1)
    {
        if(b&1)
            ans=ans*a%p;
        a=a*a%p;
    }
    return ans;
}
int main()
{
    ll m,s=-5,k=-1,i=0;
    cin>>m;
    for( i=0; i<=m; i++)
    {
        s+=5,k++;
        if(k%5==0&&k!=0)
        {
            ll t=k;
            while(t%5==0)
                t=t/5,i++;
        }
    }
    //cout<<i<<' '<<m<<endl;
    if(i==m+1)
    {
        cout<<5<<endl;
        for(ll j=1; j<=5; j++)
            cout<<s+j-1<<' ';
    }
    else
        cout<<0<<endl;
    return 0;
}