#C5260. Pumpkin Arrangements

    ID: 48890 Type: Default 1000ms 256MiB

Pumpkin Arrangements

Pumpkin Arrangements

You are given an integer n representing the number of pumpkins. Your task is to determine the number of ways to arrange these pumpkins. Although the problem statement hints at placing pumpkins in an n x n grid, the actual requirement is to compute the number of permutations of n items, which can be expressed as the factorial of n.

Mathematically, the factorial is defined as: $$n! = 1 \times 2 \times \cdots \times n$$

Your program should read an integer from standard input and output the computed value of n! to standard output.

inputFormat

The input is provided via standard input (stdin) and consists of a single integer n (1 ≤ n ≤ 18).

outputFormat

The output should be printed to standard output (stdout) and is the factorial of n, i.e. n!.

## sample
1
1

</p>