Bibig wants to know is he the most orz man in the lab.So he asked his wife.She thought for a while, and she decide to

play a game with bibig.If bibig wins ,he is the most orz man in the lab.Here are the rules:
1.There are n(0<=n<=1e9) orzers in the lab initially.
2.Everyone takes turns to get q(0<q<=n) orzers out.
3.q must be a power of 2.
4.If it's your turn and there is no orzer ,you lose.
5.Bibig always takes out firstly.
Bibig is buzy with orzing.Please tell him is he the most orz man in the lab.

There are multiple cases.The number of cases is no more than 1e6.
For each case,give a number n.

If he is the most orz man in the lab,print "Yes".In other cases, print

"No".