Problem Description

Find $n!$, that is, $1 \times 2 \times 3 \dots \times n$.

Challenge: Try to complete this task without using loop statements (for, while).

Input Format

The first line contains a positive integer $n$.

Output Format

Output a positive integer, representing $n!$.

3

6

Hint

Constraints: It is guaranteed that $1 \leq n \le 12$.

Translated by ChatGPT 5