Bibig wants to know whether he is the most orzed and orzing man in the lab.So he asked his concubine.
She thought for a while, and decided to play a hard game with bibig.
If bibig wins ,he is the most orzed and orzing man in the lab.
Here are the rules:
1.There are n(1<=n<=1e5) groups of a[i](0<=n<=1e9) orzers in the lab initially.
2.Everyone take turns to get q(0<q<=a[i]) orzers in the ith group out, and i depends on you.
3.q must be a power of 2.
4.If it's your turn and there is no orzer ,you will lose.
5.Bibig is always takes first.
Bibig is buzy with orzing.Please tell him whether he is the most orzed and orzing man in the lab.If he is,print
"Yes".In other case, print "No".

There are multiple cases.The number of cases is no more than 100.
For each case,in the first line give a number n.
The next line contains n positive integers a[i].

If he is the most orzed and orzing man in the lab,print "Yes".In other cases, print "No".