Taco Permutations

You are given a list containing n integers. Your task is to compute the total number of distinct permutations that can be obtained by rearranging the original list. In other words, you need to output \(n!\) (i.e., factorial of \(n\)). Note that while the array of integers is given, its values do not affect the computation since the answer is based solely on n.

Example: If \(n = 4\), then the result is \(4! = 24\).

inputFormat

The input is read from standard input (stdin) and consists of two lines:

• The first line contains a single integer \(n\) (the number of elements in the list).
• The second line contains \(n\) space-separated integers. These integers are provided for completeness, but they do not affect the result.

outputFormat

Output a single integer representing \(n!\) (the factorial of \(n\)), printed to standard output (stdout).

4
1 2 3 4

24