CF903A.Hungry Student Problem

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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.

输入输出样例

输入#1
```
2
6
5
```
输出#1
```
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.

首页