The factorial of a positive integer n is the product of all positive integers less than or equal to n.

A clumsy factorial uses integers in decreasing order from n down to $1$, applying four arithmetic operations in a fixed rotating sequence: multiplication (*), division (/), addition (+), and subtraction (-).

Standard arithmetic operator precedence applies: multiplication and division are computed before addition and subtraction, and operations of the same precedence are evaluated from left to right. Division uses floor division, rounding down to the nearest integer.

Given an integer n, return the clumsy factorial of n.

Constraints:

• $1 \leq$ n $\leq 10^4$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.