B'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 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89m xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89100 xe2 x80 x89000) -- 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. The factorial of n is equal to the product of all integers from 1 to n inclusive, that is n! xe2 x80 x89= xe2 x80 x891 xc2 xb72 xc2 xb73 xc2 xb7... xc2 xb7n. In the first sample, 5! xe2 x80 x89= xe2 x80 x89120, 6! xe2 x80 x89= xe2 x80 x89720, 7! xe2 x80 x89= xe2 x80 x895040, 8! xe2 x80 x89= xe2 x80 x8940320 and 9! xe2 x80 x89= xe2 x80 x89362880.'...