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.

Solution (in PYTHON3):

Solution:
a=int(input())
def gh(x):
    k=0
    p=5
    while x>=p:k+=x//p;p*=5
    if k>a:return 1
    elif k==a:return 2
    else:return 0
lo=0;hi=500000;ans=-1
while lo<=hi:
    mid=(lo+hi)//2
    ok=gh(mid)
    if ok==1:hi=mid-1
    elif ok==2:ans=mid;break
    else:lo=mid+1
if ans==-1:print(0)
else:
    print(5)
    f=ans//5
    for i in range(5):print(5*f+i,end=' ')