[Solution] Construct N CodeChef Solution

You are given an integer N$N$. Find if it is possible to represent N$N$ as the sum of several(possibly zero) 2$2$'s and several(possibly zero) 7$7$'s.

Formally, find if there exist two integers X,Y (X,Y≥0)$X,Y(X,Y\ge 0)$ such that 2⋅X+7⋅Y=N$2\cdot X+7\cdot Y=N$.

Input Format

• The first line of input will contain a single integer T$T$, denoting the number of test cases.
• Each test case consists of a single line containing an integer N$N$.

Solution Click Below:-  👉CLICK HERE👈

👇👇👇👇👇

Output Format

For each test case, print on a new line YES if it is possible to represent N$N$ as the sum of several(possibly zero) 2$2$'s and several(possibly zero) 7$7$'s and NO otherwise.

Similar Heights Codechef Solution

Construct N CodeChef Solution

Chef On Date CodeChef Solution

Chess Time CodeChef Solution

Minimum Coins CodeChef Solution

End Sorted CodeChef Solution

Copy and Push Back CodeChef Solution

The XOR-OR Dilemma CodeChef Solution

You may print each character of the string in either uppercase or lowercase (for example, the strings yEs, yes, Yes, and YES will all be treated as identical).

Constraints

• 1≤T≤1000$1\le T\le 1000$