QOJ.ac

QOJ

Time Limit: 1 s Memory Limit: 32 MB Total points: 10

#10386. Double Factorial [B]

统计

For a positive integer $ n $, its factorial is defined as the product of all integers from 1 to $ n $, denoted as $ n!$. Now $ n $ double factorial is the product of 1 factorial, 2 factorial, ..., up to $ n $ factorial: $1! \cdot 2! \cdot 3! \cdot \ldots \cdot n!$. Given $ n $, find the number of trailing zeros of a decimal representation of $ n $ double factorial.

Input Format

The first and only line of the standard input contains an integer $ n $ ($1 ≤ n ≤ 10^{18}$).

Output Format

The first and only line of the standard output should contain the number of trailing zeros of $ n $ double factorial.

Example

Input

11

Output

9

Notes

11 double factorial equals 265 790 267 296 391 946 810 949 632 000 000 000. This number has 9 trailing zeros.

About Issues

We understand that our problem archive is not perfect. If you find any issues with the problem, including the statement, scoring configuration, time/memory limits, test cases, etc.

You may use this form to submit an issue regarding the problem. A problem moderator will review your issue and proceed it properly.

STOP! Before you submit an issue, please READ the following guidelines:

  1. This is not a place to publish a discussion, editorial, or requests to debug your code. Your issue will only be visible by you and problem moderators. Other users will not be able to view or reply your issues.
  2. Do not submit duplicated issues. If you have already submitted one, please wait for an moderator to review it. Submitting multiple issues will not speed up the review process and might cause your account to be banned.
  3. Issues must be filed in English or Chinese only.
  4. Be sure your issue is related to this problem. If you need to submit an issue regarding another problem, contest, category, etc., you should submit it to the corresponding page.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0

No issues in this category.