TWOSQRS  Two squares or not two squares
Given integer n decide if it is possible to represent it as a sum of two squares of integers.
Input
First line of input contains one integer c <= 100  number of test cases. Then c lines follow, each of them consisting of exactly one integer 0 <= n <= 10^12.
Output
For each test case output Yes if it is possible to represent given number as a sum of two squares and No if it is not possible.
Example
Input: 10 1 2 7 14 49 9 17 76 2888 27 Output: Yes Yes No No Yes Yes Yes No Yes No
hide comments
amanjainnnn:
20200731 21:02:36
Take care of output, It's "Yes" not "YES. Just wasted 3 hrs on this. Phew.


mrmajumder:
20200322 16:49:43
@zerodark


zerodark:
20200213 07:51:10
For Test case 0 output is NO 

tarun_28:
20191209 15:31:09
Explicit type conversion works well.. 

krish3d2y:
20191120 00:24:41
AC with precomputation and binary search!! :) 

killer_knight:
20190929 14:18:57
make sure to use every variable as long long..costed me 1 WA :( 

prashantpx_1:
20190716 07:26:56
Take care of "NO" I got 1 WA for that. 

sanket17:
20190713 08:51:04
hint: Sometime typecating is very useful 

tanav_shah1:
20190326 15:40:53
Nice Problem, AC in 1 go! 

dev_gupta01:
20190201 15:10:08
take care it's "No" not "NO" 
Added by:  gawry 
Date:  20040629 
Time limit:  2s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 