Rearranging digits to get a multiple of 5

 Given a positive integer 

N$N$, MoEngage wants you to determine if it is possible to rearrange the digits of N$N$ (in decimal representation) and obtain a multiple of 5$5$.

For example, when N=108$N=108$, we can rearrange its digits to construct 180=36⋅5$180=36\cdot 5$ which is a multiple of 5$5$.

Input Format

• The first line contains an integer T$T$, the number of test cases. The description of the T$T$ test cases follow.
• Each test case consists of two lines
• The first line contains a single integer D$D$, the number of digits in N$N$.
• The second line consists of a string of length D$D$, the number N$N$ (in decimal representation). It is guaranteed that the string does not contain leading zeroes and consists only of the characters 0,1,…9$0,1,\dots 9$.

Output Format

• For each test case, print Yes$\mathtt{\text{Yes}}$ if it is possible to rearrange the digits of N$N$ so that it becomes a multiple 5$5$. Otherwise, print No$\mathtt{\text{No}}$.

You may print each character of the string in uppercase or lowercase (for example, the strings YeS$\mathtt{\text{YeS}}$, yEs$\mathtt{\text{yEs}}$, yes$\mathtt{\text{yes}}$ and YES$\mathtt{\text{YES}}$ will all be treated as identical).

Constraints

• 1≤T≤1000$1\le T\le 1000$
• 1≤D≤1000$1\le D\le 1000$
• 1≤N<101000$1\le N<{10}^{1000}$
• Sum of D$D$ over all test cases ≤1000$\le 1000$.

Sample Input 1 

3
3
115
3
103
3
119

Sample Output 1 

Yes
Yes
No

Explanation

Test Case 1$1$: The given number is already divisible by 5$5$, therefore the answer is Yes$\mathtt{\text{Yes}}$.

Test Case 2: We can obtain 310=62⋅5$310=62\cdot 5$ by rearranging the digits of 103$103$, so the answer is Yes$\mathtt{\text{Yes}}$.

Test Case 3: The only numbers that can be obtained by rearranging the digits of 119$119$ are {119,191,911}$\{119,191,911\}$. None of these numbers are multiples of 5$5$, so the answer is No$\mathtt{\text{No}}$.