Calculate MDAS Factorial of given number

Given an integer N, the task is to find the MDAS factorial.
The general factorial of a no. N is given by:  

Factorial(N) = (N)*(N-1)*(N-2)*(N-3)*(N-4)*(N-5)*(N-6)*(N-7)- – – – – -(3)*(2)*(1).  

In MDAS factorial, instead of simply multiplying the numbers from N to 1, we perform four operations, Multiplication(*), Divide(/), Addition(+) and Subtraction(-) in a repeating pattern as shown below: 

MDAS_Factorial(N) = (N) * (N-1) / (N-2) + (N-3) – (N-4) – – – – – upto 1.  

By using the integers in decreasing order, we swap the multiplication operations for fixed rotation of operations: multiply (*), divide (/), add (+) and subtract (-) in the above order.
 

Examples: 

Input : N = 4
Output : 7
Explanation : MDAS_Factorial(4) = 4 * 3 / 2 + 1 = 7

Input : N = 10
Output : 12
Explanation : 
MDAS_Factorial(10) = 10 * 9 / 8 + 7 - 6 * 5 / 4 + 3 - 2 * 1 = 12 

Simple Approach: The idea is to use a loop for each cycle of operations (*,/,+,-) and calculate the MDAS Factorial of N. But this may work slow if N is very large. The Time Complexity of this approach is O(N).

Efficient Approach: 
If we observe carefully it can be concluded that: 

1. If N is less than or equal to 2 then the answer will be N itself.
2. If N is 3 OR N is 4, the answer is N + 3.
3. If (N – 4) is completely divisible by 4, the answer is N + 1.
4. If (N – 4) gives remainder 1 OR 2 while dividing by 4, the answer is N + 2.
5. For the remaining values, the answer will be N – 1.

Below is the implementation of the above approach 

Output: 

7
12

Time complexity: O(1), since no loop is there.
Auxiliary space: O(1), since no extra space has been taken.