output_description: Print the number of trailing zeros in the decimal notation of f(N).
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
attempt: N = int(input())
  two = 2
  two_cnt = 0
  while two <= N:
      two_cnt += (N // two) // 2
      two *= 2
  five = 5
  five_cnt = 0
  while five <= N:
      five_cnt += (N // five) // 2
      five *= 5
  print(min(two_cnt, five_cnt))
  
problem_description: Statement
  
  For an integer n not less than 0, let us define f(n) as follows:
  
    * f(n) = 1 (if n < 2)
    * f(n) = n f(n-2) (if n \geq 2)
  
  Given is an integer N. Find the number of trailing zeros in the decimal
  notation of f(N).
samples: [{"input": "12", "output": "1\n    \n\nf(12) = 12 \u00d7 10 \u00d7 8 \u00d7 6 \u00d7 4 \u00d7 2 = 46080, which has one trailing zero.\n\n* * *"}, {"input": "5", "output": "0\n    \n\nf(5) = 5 \u00d7 3 \u00d7 1 = 15, which has no trailing zeros.\n\n* * *"}, {"input": "1000000000000000000", "output": "124999999999999995"}]