Mathematics Revisited !!
You are given the value of n. Find the number of solutions to the eqautions
x + 2y + 2z = n.
x,y,z can take non-negative integer values only.
The first line contains a single integer T, the number of test cases. T test cases follow each containing a single line conntaining a single integer n.
Output one line for each test case each containing a single number that being the number of solutions to the eqaution.
T <= 10000
1 <= N <= 10000
Work out for a formula. Do not iterate through nested loops.
Problem Setter : Shikhar Sharad
Problem Tester: Shradha Chhaparia