A positive integer is called a "$Yiding Number$" when it can be obtained by one of the following two rules.
Rule $1$: The positive integer $1$ is a "$Yiding Number$". Rule $2$: If $n$ is a "$Yiding Number$", then $5n+13$, $13n+5$, $5n-13$, $13n-5$ are also "$Yiding Numbers$".
Now, given a positive integer n, please determine it is a "Yiding Number" or not.
输入解释
There is an integer $T$ in the first line, indicating that there are $T$ test cases;
For the next $T$ lines, each line contains a positive integer $n (n<=1000000)$.
输出解释
For each test cases, output "Yes" if $n$ is a "$Yiding Number$", otherwise output "No".