Divide the number
Submissions: 403   Accuracy:

35.97%

  Difficulty: Basic   Marks: 1

Given a positive integer N, count the number of possible ways to represent N as sum of four positive integers.

Input
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.

Output
Print out the number of ways to divide N in four parts.

Constraints
1 <= T <= 100
0 <= N <=300

Examples 

Input
3
5
41
500

Output
1
511
873264

Explanation

Output 1:  There is only one way to divide 5  (1, 1, 1, 2)

** For More Input/Output Examples Use 'Expected Output' option **

Author: Rohan Malhotra


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.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.


to report an issue on this page.