CF903A.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!

伊万在大学的课程刚刚结束，现在他想去当地的 CFK 咖啡馆吃一些炸鸡。

CFK 咖啡馆以小份和大份两种规格出售鸡块：小份包含 3 块，大份包含 7 块。伊万想恰好吃掉 $x$ 块鸡块。现在他想知道，自己能否恰好买到 $x$ 块鸡块。

形式化地说，伊万想知道：是否存在两个非负整数 $a$ 和 $b$，使得 $a$ 个小份与 $b$ 个大份所含鸡块总数恰好为 $x$ 块。

请帮助伊万对多个不同的 $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.

第一行包含一个整数 $n$（$1 \leq n \leq 100$）—— 表示测试用例的数量。

接下来的 $n$ 行中，第 $i$ 行包含一个整数 $x_i$（$1 \leq x_i \leq 100$）—— 表示 Ivan 想要吃的鸡块数量。

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

输出 n 行，在第 i 行中，如果 Ivan 恰好能购买 x__i 块，则输出 YES；否则输出 NO。

In the first example Ivan can buy two small portions.

In the second example Ivan cannot buy exactly 5 chunks, since one small portion is not enough, but two small portions or one large is too much.

在第一个例子中，伊万可以购买两份小份餐。

在第二个例子中，伊万无法恰好购买 5 块，因为一份小份餐不够，而两份小份餐或一份大份餐又太多了。