#P1494B. Berland Crossword

    ID: 2427 Type: RemoteJudge 2000ms 256MiB Tried: 0 Accepted: 0 Difficulty: 4 Uploaded By: Tags>bitmasksbrute forcegreedyimplementation*1400

Berland Crossword

Description

Berland crossword is a puzzle that is solved on a square grid with nn rows and nn columns. Initially all the cells are white.

To solve the puzzle one has to color some cells on the border of the grid black in such a way that:

  • exactly UU cells in the top row are black;
  • exactly RR cells in the rightmost column are black;
  • exactly DD cells in the bottom row are black;
  • exactly LL cells in the leftmost column are black.

Note that you can color zero cells black and leave every cell white.

Your task is to check if there exists a solution to the given puzzle.

The first line contains a single integer tt (1t10001 \le t \le 1000) — the number of testcases.

Then the descriptions of tt testcases follow.

The only line of each testcase contains 55 integers n,U,R,D,Ln, U, R, D, L (2n1002 \le n \le 100; 0U,R,D,Ln0 \le U, R, D, L \le n).

For each testcase print "YES" if the solution exists and "NO" otherwise.

You may print every letter in any case you want (so, for example, the strings yEs, yes, Yes and YES are all recognized as positive answer).

Input

The first line contains a single integer tt (1t10001 \le t \le 1000) — the number of testcases.

Then the descriptions of tt testcases follow.

The only line of each testcase contains 55 integers n,U,R,D,Ln, U, R, D, L (2n1002 \le n \le 100; 0U,R,D,Ln0 \le U, R, D, L \le n).

Output

For each testcase print "YES" if the solution exists and "NO" otherwise.

You may print every letter in any case you want (so, for example, the strings yEs, yes, Yes and YES are all recognized as positive answer).

Sample Input 1

4
5 2 5 3 1
3 0 0 0 0
4 4 1 4 0
2 1 1 1 1

Sample Output 1

YES
YES
NO
YES

Note

Here are possible solutions to testcases 11, 22 and 44: