Given a positive integer N, count the number of possible ways to represent N as sum of four positive integers.
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow.
The first line of each test case contains a positve integer N.
Print out the number of ways to divide N in four parts.
1 <= T <= 100
0 <= N <= 300
Output 1: There is only one way to divide 5 (1, 1, 1, 2)
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.