|All-time Popular Problems|
|Delete without head pointer|
|Check if a number is power of another number|
|Array to BST|
|Implement Queue using Linked List|
|Lowest Common Ancestor in a BST|
|Reverse a Linked List in groups of given size.|
|Print all nodes that don’t have sibling|
|Equal to product|
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.