Ninja has created his own encryption technique to encrypt a number. He makes use of the logic behind factorial. In a factorial, we multiply the number by its previous number and so on but if we want to encrypt a number we don’t multiply in every step like in the case of factorial but multiply, divide, add and subtract and repeat in the same order.
So your task is to find the encrypted form of a number using the ninja encryption technique and you were being provided with the number.
The first line contains an integer 'T' which denotes the number of test cases or queries to be run.
The first line of each test case contains a single integer ‘N’ denoting the given number.
For each test case, print a single line containing the encrypted form of the number.
The output of each test case will be printed in a separate line.
You do not need to print anything, it has already been taken care of. Just implement the given function.
1 <= T <= 5
1 <= N <= 5000
Time Limit: 1 sec
Can you do this in constant time and space?
Sample Input 1:
Sample Output 1:
Explanation For Sample Input 1:
Test Case 1:
For the first test case, given number is ‘5’ so using the ninja encryption technique we follow the steps: ( 5 * 4 / 3 + 2 - 1 ) = 7
Test Case 2:
For the first test case, the given number is ‘8’ so using the ninja encryption technique we follow the steps: ( 8 * 7 / 6 + 5 - 4 * 3 / 2 - 1 ) = 9
Sample Input 2:
Sample Output 2: