CF1266B.Dice Tower

Bob is playing with $6$-sided dice. A net of such standard cube is shown below.

He has an unlimited supply of these dice and wants to build a tower by stacking multiple dice on top of each other, while choosing the orientation of each dice. Then he counts the number of visible pips on the faces of the dice.

For example, the number of visible pips on the tower below is $29$ — the number visible on the top is $1$, from the south $5$ and $3$, from the west $4$ and $2$, from the north $2$ and $4$ and from the east $3$ and $5$.

The one at the bottom and the two sixes by which the dice are touching are not visible, so they are not counted towards total.

Bob also has $t$ favourite integers $x_i$, and for every such integer his goal is to build such a tower that the number of visible pips is exactly $x_i$. For each of Bob's favourite integers determine whether it is possible to build a tower that has exactly that many visible pips.

鲍勃正在玩六面骰子。一个标准立方体骰子的展开图如下所示：

他拥有无限数量的此类骰子，并希望将多个骰子堆叠起来构成一座塔，且可自由选择每个骰子的朝向。随后，他统计该塔所有可见面上的点数（pips）总数。

例如，下图所示塔的可见点数总和为 $29$：顶部可见点数为 $1$；从南侧可见点数为 $5$ 和 $3$；从西侧可见点数为 $4$ 和 $2$；从北侧可见点数为 $2$ 和 $4$；从东侧可见点数为 $3$ 和 $5$。

位于最底部的骰子底面，以及各相邻骰子相互接触的两个面（其点数均为 $6$），均不可见，因此不计入总数。

此外，鲍勃有 $t$ 个他喜爱的整数 $x_i$；对每个这样的整数，他的目标是构造一座塔，使其可见点数之和恰好等于 $x_i$。请针对鲍勃的每一个喜爱整数，判断是否能够构造出可见点数之和恰好为该整数的塔。

The first line contains a single integer $t$ ($1 \leq t \leq 1000$) — the number of favourite integers of Bob.

The second line contains $t$ space-separated integers $x_i$ ($1 \leq x_i \leq 10^{18}$) — Bob's favourite integers.

第一行包含一个整数 $t$（$1 \leq t \leq 1000$）—— 表示鲍勃最喜爱的整数的个数。

第二行包含 $t$ 个以空格分隔的整数 $x_i$（$1 \leq x_i \leq 10^{18}$）—— 鲍勃最喜爱的整数。

For each of Bob's favourite integers, output "YES" if it is possible to build the tower, or "NO" otherwise (quotes for clarity).

对于鲍勃的每个最爱整数，如果能够建造该塔，则输出 “YES”，否则输出 “NO”（引号仅用于明确界定）。

The first example is mentioned in the problem statement.

In the second example, one can build the tower by flipping the top dice from the previous tower.

In the third example, one can use a single die that has $5$ on top.

The fourth example is impossible.

第一个例子在题目描述中已提及。

在第二个例子中，可以通过翻转前一座塔顶部的骰子来构建新塔。

在第三个例子中，可以使用一个顶面点数为 $5$ 的单个骰子。

第四个例子是不可能实现的。