A11565 | Hungry Student Problem

Ivan's classes at the university have just finished, and now he wants to go to the local CFK cafe and eat some fried chicken.

CFK sells chicken chunks in small and large portions. A small portion contains $3$ chunks; a large one — $7$ chunks. Ivan wants to eat exactly $x$ chunks. Now he wonders whether he can buy exactly this amount of chicken.

Formally, Ivan wants to know if he can choose two non-negative integers $a$ and $b$ in such a way that $a$ small portions and $b$ large ones contain exactly $x$ chunks.

Help Ivan to answer this question for several values of $x$ !

The first line contains one integer $n$ ( $1<=n<=100$ ) — the number of testcases.

The $i$ -th of the following $n$ lines contains one integer $x_{i}$ ( $1<=x_{i}<=100$ ) — the number of chicken chunks Ivan wants to eat.

Print $n$ lines, in $i$ -th line output YES if Ivan can buy exactly $x_{i}$ chunks. Otherwise, print NO.