#描述#
Maybe you have known this game.There are n stones on the table.
lily and JJ take stones in turn.But they can only take 1,2 or 9 stones at a time.The one get the last stones wins and lily always takes first.The question is weather lily can win.Both lily and JJ are good player of this game.

#格式#
##输入格式##
The first line is a integer t (the number of test cases).
Each of the following t lines contains one integer n.(0&ltn&lt2^31).

##输出格式##
Yes if lily can win,No otherwise.

#样例1#
##样例输入1##

5
1
2
3
6
9

##样例输出1##

Yes
Yes
No
No
Yes

#限制#
1000ms
32768KB

#提示#

#来源#
lily