Problem Description
A Q-sequence is defined as:
Q-Seq := 0 or
Q-Seq := Q-seq Q-seq 1
That is to say a Q-Sequence is a single '0' or two Q-Sequences followed by an '1'.
Given a sequence of '0's and '1's, you are to determine whether it is a Q-Sequence.
Input
The first line is a number n refers to the number of test cases. Then n lines follows, each line has a string made up of '1's and '0's. The maximum length of the sequence is 1000.
Output
The output contain n lines, print "Yes" if it is a Q-sequence, otherwise print "No".
Sample Input
3
0010011
0101
00011
Sample Output
Yes
No
Yes