Today is Saturday so Px went to a restaurant to have dinner where he saw dishes placed on an infinite length table. Dishes were labeled in order D0, D1, D2,...........Dinfinite . Px loves to have a non-veg meal. He got the information from his friend Shivam that dish DN is a non-veg dish.
Initially, Px is standing in front of Dish D0 . Px was confused whether he could have the non-veg dish or not. From dish, Di Px can move only to dish Di+2 in one step.
Px is a newbie at programming. So he asks for your help to know whether he would have a non-veg meal that day or he will return having a veg meal which he dislikes.
Input :
The first line of input contains the number of test cases T. Following each test case there is a single line consisting of the non-veg dish number N.
Constraints :
1 <= T <= 100
0 <= N <= 10^6
Output :
Output "Yes" (without quotes) if Px wil have non-veg meal that day else output "No" (without quotes).
Px was standing on the dish D0 initially, So without any further steps, he would have the non-veg meal.
