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:
#!/usr/bin/env python3
import collections, itertools, fractions, functools, heapq, math, queue, operator

def fac0(n):
  r = 0
  f = 1
  for i in range(2, n+1):
    f *= i
    while f%10 == 0:
      f //= 10
      r += 1
    f %= 1000000
  return r

def result(n, z):
  r = []
  for i in range(max(1, n-5), n+5):
    if fac0(i) == z:
      r.append(i)
  print(len(r))
  print(*r)

def solve(n):
  lo = 1
  hi = 500000

  while lo <= hi:
    mid = (lo + hi)//2
    r = fac0(mid)
    if r == n:
      result(mid, n)
      return
    elif r < n:
      lo = mid+1
    elif r > n:
      hi = mid-1

  print(0)

if __name__ == '__main__':
  solve(int(input()))