DOTS - Dots

Given N dots and you can make exactly N dots Right Triangle. Rearrange the dots (and give a number N), like this:

Now you task is to find right triangle number or not.

Input

An integer T (1 <= T <=1000) denoting the number of test cases followed by T lines. Each containing a single integer N (1 <= N <= 50005000).

Output

For each case you have to print “Yes” if it is N dots right triangle otherwise “No”.

Example

Input:
3
6
4
21

Output:
Yes
No
Yes

Problem setter: Shipu Ahamed, Dept. of CSE
Bangladesh University of Business and Technology (BUBT)


Added by:Shipu Ahamed
Date:2013-09-18
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64

© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.