Given a number N, the task is find the number of ways to represent this number as a sum of 2 or more consecutive natural numbers.
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case contains an integer N as input.
For each test case, print the total number of ways In new line. If the number can not be represent in the required way, print "0" without quotes.
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.