By Felipe Menescal e João Rafael, UFRN Brazil
A proliferous car robber from Bronx is known for steal cars from Pontial company. Detective Jaques has been working for ten years on the case pursuing the Pontial bandict. After all this time, the detective was able to recognize a pattern on the files of the precinct: the regist number of the cases involving the Pontial bandict are always divisible by seven, are odd and, if summed to two, are prime. Detective Jaques is not used to do math so he asked your help to know if Douglas will strikes again given the number of the last case registered on the precinct.(The error found can be solved by adding +1 to the entry number)
The first line of each test case contains one integers integer n \((1\leq n \leq10^4 )\), the number of queries detective Jaques wants. The next lines n contains the number of the last case registered on the precinct.
For each query, print "Yes" if the case will be related to Douglas and print "No" otherwise.
|Input Sample||Output Sample|