Minimum Days to Deliver Letters

You are given a positive integer n representing the number of letters to be delivered. In the worst-case scenario, the number of days required to deliver all letters is given by n! (n factorial). The factorial of a natural number n is defined as:

\( n! = 1 \times 2 \times 3 \times \cdots \times n \)

Your task is to compute n! given the integer n.

inputFormat

The input consists of a single integer n (where 1 ≤ n ≤ 20) provided via standard input.

outputFormat

Output a single integer representing the factorial of n via standard output.

1

1